22819

Appears in sequences

• a(n) = Sum_{k=0..8} binomial(n,k).at n=15A008861
• Super-4 Numbers (4 * n^4 contains substring '4444' in its decimal expansion).at n=19A032744
• a(n) = 2^n - C(n,0) - C(n,1) - ... - C(n,6).at n=15A035039
• Numbers k such that the digits of k^3 occur with the same frequency.at n=57A052047
• Numbers k such that k^3 is a cube whose digits occur with an equal minimum frequency of 2.at n=16A052051
• Numbers n such that n!! + 2^2 is prime.at n=17A076186
• Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.at n=16A079280
• Expansion of (sqrt(1 - 4*x) + (1 - 2*x))/(2*(1 - 4*x)).at n=8A114121
• Expansion of ((1 + x - 2x^2) + (1+x)*sqrt(1-4x^2))/(2(1-4x^2)).at n=16A116406
• Record values in A131361.at n=18A131362
• 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, 0, 1), (1, -1, -1), (1, 1, 0)}.at n=10A148614
• Number of planar n X n X n binary triangular grids with no more than 8 ones in any 5 X 5 X 5 subtriangle.at n=5A153542
• Number of planar n X n X n binary triangular grids with no more than 8 ones in any similarly oriented 5 X 5 X 5 subtriangle.at n=5A153570
• Number of nX3 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=27A166781
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=32A270327
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=6A299176
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A299179
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=48A299180
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=51A299180
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A299941