22197

Appears in sequences

• a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=3.at n=16A024947
• Denominators of continued fraction convergents to sqrt(932).at n=11A042803
• Values of n such that A006046(n)/n^theta, where theta=log(3)/log(2), is a local minimum, computed according to Harborth's recurrence.at n=14A077465
• Cumulative minima of A006046(n)/n^theta, where theta=log(3)/log(2), is a local minimum.at n=16A084230
• a(n) = (4*n+3)*(4*n+7).at n=36A085027
• a(n) = (8*n+3)*(8*n+7).at n=18A146301
• a(n) = A153801(n)/2.at n=26A153804
• Numbers n such that n^6 + 272 is prime.at n=30A161998
• a(n) = A061037(7*n+2).at n=21A165943
• a(n) = prime(n)^2-4.at n=34A166010
• a(n) = 16*n^4 + 256*n^3 + 1160*n^2 + 1088*n + 285.at n=3A176712
• a(n) = prime(n)^2 - 4*prime(n).at n=33A245034
• Number of (n+1) X (2+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=5A250749
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=26A250755
• Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=1A250761
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 467", based on the 5-celled von Neumann neighborhood.at n=31A272320
• Triangle read by rows: T(n,k) number of ways of partitioning the (n+4)-element multiset {1,1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 4.at n=74A291119
• Binary "cubes"; numbers whose binary representation consists of three consecutive identical blocks.at n=20A297405
• Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426).at n=40A342427
• Numbers that can be represented in more than one way as p^2+p*q+q^2 with p and q primes, p<=q.at n=20A349987