39339

Appears in sequences

• Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=27A007588
• Numbers that are the sum of 3 positive cubes in exactly 3 ways.at n=22A025397
• Numbers that are the sum of 3 positive cubes in 3 or more ways.at n=23A025398
• Numbers that are the sum of 3 distinct positive cubes in exactly 3 ways.at n=19A025401
• Numbers that are the sum of 3 distinct positive cubes in 3 or more ways.at n=20A025402
• Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.at n=31A066484
• Smallest k>n such that n^3+1 divides k*n^2+1.at n=34A071568
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, -1), (1, 0, -1), (1, 0, 0)}.at n=10A148395
• (n-1)^(p-n+1)+n where p is the smallest prime > n-1.at n=34A171424
• Small rhombicuboctahedron with faces of centered polygons.at n=13A193250
• Numbers that can be expressed as the sum of three nonnegative cubes in three ways.at n=27A219329
• Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 3.at n=15A244532
• Partial sums of A080715.at n=43A268403
• Numbers with digits 3 and 9 only.at n=39A284964
• Number of recursively anti-transitive rooted identity trees with n nodes.at n=19A324767
• Number of chordless cycles (with length >= 4) in the complement of the n X n X n grid graph.at n=4A364273
• a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} gcd(x_1, x_2, n)/gcd(x_1, x_2, x_3, n).at n=29A373061