22144
domain: N
Appears in sequences
- Coloring a circuit with 4 colors.at n=10A006342
- a(n) = Sum_{k=0..floor(n/2)-2} T(n,k) * T(n,k+3), with T given by A026009.at n=6A027290
- Numbers whose set of base-9 digits is {3,4}.at n=31A032833
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 5).at n=50A035563
- Number of distinct quadratic residues mod 3^n.at n=10A039300
- Number of distinct quadratic residues mod 9^n.at n=5A039306
- Numbers having four 3's in base 9.at n=15A043468
- a(n) = smallest number x such that sigma(x) = 2x + 2n.at n=41A087998
- Expansion of e.g.f.: exp(exp(x)/sqrt(2-exp(2*x))-1).at n=5A124213
- Number of Greek-key tours on an n X n board; i.e., self-avoiding walks on n X n grid starting in top left corner.at n=5A145157
- a(0)=4; a(n)=n^2+a(n-1) for n>0.at n=40A153058
- Number of Greek-key tours on a 6 X n grid.at n=5A160240
- Number of (n+1) X (n+1) 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock differing from the number in all its horizontal and vertical neighbors.at n=8A205064
- Expansion of (phi(x) / f(-x^4))^4 in powers of x where phi(), f() are Ramanujan theta functions.at n=23A227175
- Square array: A(row,col) = A003602(A254051(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=77A254055
- The first of 50 consecutive positive integers the sum of the squares of which is a square.at n=22A269451
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 918", based on the 5-celled von Neumann neighborhood.at n=35A273748
- Primitive practical numbers of the form 2^i * prime(k).at n=38A308710
- Numerator of (1+sigma(s)) / ((s+1)/2), where s is the square of n prime-shifted once (s = A003961(n)^2 = A003961(n^2)).at n=43A337338
- a(n) is the smallest abundant number of the form 2^e * prime(n).at n=38A341361