22768

Appears in sequences

• Least positive unitary linear combination of distinct numbers in row n of Pascal's triangle; i.e., least positive sum of form d(0)C(n-1,0) + d(1)C(n-1,1) + ...+ d(m)C(n-1,m), d(i)=+-1, m = floor((n+1)/2).at n=24A004795
• Numbers k such that k-th and (k+1)-st term of A038593 differ by 4.at n=11A038635
• Numbers k such that 3^(2*k-1) + 2 is prime.at n=15A134753
• Records in A064844.at n=23A135987
• 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, 0), (0, 0, 1), (0, 1, 0), (1, -1, 0)}.at n=9A149877
• Monotonic ordering of nonnegative differences 2^i-10^j, for 40>= i>=0, j>=0.at n=40A192124
• Number of partitions p of n such that max(p)-min(p) = 9.at n=41A218572
• Concatenation of n-th prime and n-th nonprime.at n=48A253910
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=6A298283
• Number of n X 7 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=3A298286
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=48A298287
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=51A298287
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299358
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=48A299359
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=51A299359
• Number of edges formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=13A331765
• Distance of closest integer power of 10 to the n-th power of 2.at n=15A334588