21087

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = a(2) = 1 and a(3) = 4.at n=14A049944
• Number of numbers with 6 decimal digits and sum of digits = n.at n=17A090581
• Number of numbers with 6 decimal digits and sum of digits = n.at n=36A090581
• Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=14A096554
• a(n) = 1331*n - 209.at n=15A157444
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+497)^2 = y^2.at n=21A207077
• Numbers k such that 3*k is a partition number.at n=19A213365
• Number of (2+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=26A250757
• a(n) = 3^n*hypergeom([-n/3, (1-n)/3, (2-n)/3], [1, 1], -1).at n=7A294035
• Number of n X 6 0..1 arrays with each 1 adjacent to 3 or 5 king-move neighboring 1's.at n=6A296155
• Number of n X 7 0..1 arrays with each 1 adjacent to 3 or 5 king-move neighboring 1's.at n=5A296156
• a(n) is the number of rooted 3-connected bicubic planar maps with 2n vertices.at n=13A298358
• Row sums of the triangle A322550.at n=28A320043
• Number of partitions p of n such that max(p) == 2 mod 3.at n=43A373015