40509

Appears in sequences

• Expansion of 1/((1-x)(1-2x)(1-6x)(1-11x)).at n=4A021204
• Array A(x,y) giving the position of the y-th x in A080237 listed by rising antidiagonals.at n=56A085178
• Let a_0 = 1 and for n > 0, let a_n be the smallest positive integer not already in the sequence such that (a_0 + a_1 x + a-2x^2 + ....)^(1/3) has integer coefficients. (Hanna's A083349). Let f(n) = n th term in the present sequence. Then a_0 + a_1 x + a_2 x^2 + ... = (1-x)^f(1) (1-x^2)^f(2) (1-x^3)^f(3) ....at n=30A110879
• a(1)=1. a(n) = Sum_{1<=k<n, gcd(k,n(n+1))=1} a(k).at n=46A125596
• a(n) = 24*n^2 + 52*n + 29.at n=40A258721
• Start with a square; at each stage add a square at each expandable vertex so that the ratio of the side of the squares at stage n+1 and at stage n is the golden ratio phi=0.618...; a(n) is the number of squares in a portion of the n-th stage (see below).at n=14A269964
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=40A271150
• Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n that remain unchanged by a rotation of 90 degrees.at n=55A277085
• Numbers k such that 413*2^k+1 is prime.at n=23A323106
• Irregular triangle read by rows: T(n,k) is the number of n-permutations whose third-shortest cycle has length exactly k; n >= 0, 0 <= k <= max(0,n-2).at n=32A350016