18565

Appears in sequences

• Number of numbers == 0 (mod 3) in range 2^n to 2^(n+1) with odd number of 1's in binary expansion.at n=16A000773
• Expansion of bracket function.at n=12A006090
• Odd octagonal numbers: (2n+1)*(6n+1).at n=39A014641
• Expansion of 1/((1-x)*(1-3*x)*(1-4*x)).at n=6A016208
• Number of partitions of n into prime power parts (1 included); number of nonisomorphic Abelian subgroups of symmetric group S_n.at n=42A023893
• T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A027144.at n=12A027152
• Take n points in general position in the plane; draw all the (infinite) straight lines joining them; sequence gives number of connected regions formed.at n=21A055503
• 3-almost prime octagonal numbers.at n=16A129927
• Triangle, read by rows, T(n, k) = binomial(3*n, 2*k) + binomial(3*n, 2*(n-k)).at n=21A154919
• Triangle, read by rows, T(n, k) = binomial(3*n, 2*k) + binomial(3*n, 2*(n-k)).at n=27A154919
• Expansion of 1/((1-x)^6 - x^6).at n=12A192080
• a(n) = 16*n^2 + 2*n + 1.at n=34A204675
• Number of partitions of n having population standard deviation < 2.at n=47A238658
• Number of 4 X n binary arrays with rows and columns lexicographically nondecreasing and column sums nonincreasing.at n=16A266471
• Octagonal numbers with prime indices.at n=21A267144
• Squarefree composite numbers n such that b^n == b (mod gpf(n)) for every integer b, where gpf(n) = A006530(n).at n=38A276832
• Least number x such that x^n has n digits equal to k. Case k = 2.at n=18A285449
• p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - S^6.at n=17A290993
• Octagonal numbers (A000567) in which parity of digits alternates.at n=16A297647
• a(n) = Sum_{k=0..floor(n/6)} binomial(n,6*k).at n=17A306847