18566

Appears in sequences

• a(n) = p(11n+6)/11 where p(n) = number of partitions of n (A000041).at n=4A076394
• a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is odd, a(n)=a(n-1)+a(n/2) if n is even.at n=27A078912
• Convolution of the prime numbers with phi(n).at n=36A086734
• Semiprimes in A056105.at n=32A113519
• a(n) = 8*a(n-1) - 19*a(n-2) + 12*a(n-3) (n >= 3) with a(0) = a(1) = 1, a(2) = 2.at n=8A162725
• Number of partitions into a triangular number of parts.at n=45A178927
• The n-th Fourier coefficient divided by 11 of L_1(tau) defined by A. O. L. Atkin in 1967.at n=4A182668
• G.f.: A(x) = Product_{n>=1} 1/(1 - A_n(x)^n) where A_n(x) denotes the n-th iteration of A(x): A_n(x) = A_{n-1}(A(x)) with A_0(x)=x.at n=7A182970
• 1/20 of the number of (n+1) X 3 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=7A183712
• 1/20 of the number of (n+1) X 9 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=1A183718
• T(n,k) = 1/20 of the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=37A183719
• T(n,k) = 1/20 of the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.at n=43A183719
• Numbers n such that 11n is a partition number.at n=22A225323
• Number of nondecreasing -4..4 vectors of length n whose dot product with some nonincreasing -4..4 vector equals n.at n=8A226395
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 998", based on the 5-celled von Neumann neighborhood.at n=33A273857
• Indices of primes in A000712.at n=23A285217
• Number of maximal irredundant sets in the n-path graph.at n=25A291055
• p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S^6.at n=23A291381