22342

Appears in sequences

• a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.at n=16A001211
• Fibonacci numbers written in base 5.at n=17A004688
• Difference between the product of two consecutive primes and the next prime.at n=34A111071
• McKay-Thompson series of class 24b for the Monster group.at n=29A112162
• 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), (0, 1, -1), (1, 0, -1), (1, 1, -1), (1, 1, 0)}.at n=10A148444
• Number of nX6 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=1A281324
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=22A281326
• Number of 2Xn 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281327
• a(n) = Fibonacci(n) represented in bijective base-5 numeration.at n=16A282236