32481

Appears in sequences

• a(n) = (2*n+1)*(10*n+1).at n=40A033574
• Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073399.at n=11A073400
• Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073401.at n=13A073402
• G.f. -x*(x-1)*(1+x)/(1-x-8*x^2-x^3+x^4).at n=10A171065
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood.at n=28A273316
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+32478) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=3A274058
• Number of compositions of n into parts with distinct multiplicities and with exactly nine parts.at n=22A321779
• a(n) is the number of strings of length n over the alphabet {a,b,c} with the number of a's divisible by 3, and the number of b's and c's is at most 3.at n=30A340169
• Composite numbers for which A324644(n)/A324198(n) = 2 and sigma(n) == 2 (mod 4).at n=32A371082
• Expansion of e.g.f. exp(x/(1 - x^3)^(2/3)).at n=8A373518
• a(n) is the number of ways to write prime(n) as a sum of distinct composites.at n=30A381251