25287

Appears in sequences

• Apply (1+Shift) to Bell numbers.at n=9A011968
• Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=46A011971
• Sequence formed by reading rows of triangle defined in A011971.at n=37A011972
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 53.at n=2A031731
• Mirror image of the Bell triangle A011971, which is also called the Pierce triangle or Aitken's array.at n=53A123346
• 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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.at n=9A148980
• Number of nondecreasing integer sequences of length 7 with sum zero and sum of absolute values 2n.at n=24A158141
• Number of pairs of rabbits in month n in the dying rabbits problem, if they become mature after 4 months and give birth to exactly 7 pairs, one per month.at n=35A160333
• Number of n X 2 nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any diagonal or antidiagonal neighbor (colorings ignoring permutations of colors).at n=5A207978
• T(n,k)=Number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any diagonal or antidiagonal neighbor (colorings ignoring permutations of colors).at n=16A207981
• T(n,k)=Number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any diagonal or antidiagonal neighbor (colorings ignoring permutations of colors).at n=19A207981
• Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=41A240308
• Number of partitions of [n] having exactly one parity change within the partition.at n=18A363550