24196

Appears in sequences

• Number of partitions in parts not of the form 21k, 21k+3 or 21k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=42A035981
• Expansion of 1/Sum_{k>=0} (-x)^Fibonacci(k).at n=17A080889
• a(n) = 4*3^n/3 - 5*0^n/6 - (n-1)2^(n-1).at n=9A083587
• a(1) = a(2) = a(3) = 1; for n>2, a(n+1) = a(n) + a(n-1) + a(n-2) iff a(n) is prime, otherwise a(n+1) = a(n) + 1.at n=37A113058
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=37A252433
• Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=7A252435
• a(n) = n*(n+1)*(11*n +10)/6.at n=23A254407
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=29A273075
• a(n) is the number of ways to express 2*n+1 as a sum of parts x such that x+2 is an odd prime.at n=44A333615
• Numbers k such that the centered cube number k^3 + (k+1)^3 is equal to at least two other sums of two cubes.at n=11A352221