31002

Appears in sequences

• floor[2^n/Fibonacci(n)].at n=44A057861
• a(n) = prime(n) + n^3 + n^2 + 4n - 1.at n=30A060822
• 4-Smith numbers.at n=32A103125
• Admirable Harshad numbers such that the subtracted divisor is also a Harshad number.at n=23A109396
• Admirable Harshad numbers n such that the subtracted divisor is equal to the digital sum of n.at n=16A111948
• Expansion of g.f. z*(2-2*z+z^2+z^3)/((1+z)*(1-3*z+2*z^2-z^3)).at n=12A137249
• 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, 0), (-1, 1, -1), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=10A148401
• 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), (1, -1, 0), (1, 0, -1), (1, 0, 1)}.at n=10A148603
• Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks of width 1 (i.e., UHD configurations, where U=(0,1), H(1,0), D=(0,-1)), (n>=2, k>=0).at n=35A273715
• "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=30A284515
• Numbers k such that (74*10^k + 313)/9 is prime.at n=20A294942
• a(n) = 108*n^2 - 228*n + 114 (n>=2).at n=16A304618