21547

Appears in sequences

• Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.at n=18A064551
• a(n) = (2*n^3 - n^2 - n + 2)/2.at n=28A081441
• Greatest number, not divisible by 4, having exactly n partitions into three squares.at n=6A095811
• Greatest number, not divisible by 4, having exactly n partitions into three positive squares.at n=6A095812
• Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=5A207759
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=50A207762
• Number of 6 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=4A207766
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 833", based on the 5-celled von Neumann neighborhood.at n=27A273677
• Composite numbers k such that k-1 divides 2^k-2.at n=24A330382
• Triangle read by rows: T(n,k) is the number of ruler-and-compass constructions consisting of n-k lines and k circles with 0 <= k <= n.at n=30A383273