34038

Appears in sequences

• Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=41A035977
• a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=36A060630
• a(n) = 18*(n - 2)*(2*n - 5).at n=31A060787
• Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) is the least k > 1+n*(n-1)/2 such that f(k, n) is a multiple of f(1+n*(n-1)/2, n).at n=10A093908
• Numbers n such that prime(n) - n is a prime power.at n=21A109315
• Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=35A178947
• Volume of right regular hexagonal pyramid with height and side lengths n, rounded down.at n=33A234729
• Number of n X 4 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=4A278359
• Number of nX5 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=3A278360
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=31A278363
• T(n,k)=Number of nXk 0..1 arrays with rows and columns in lexicographic nondecreasing order but with exactly one mistake.at n=32A278363
• Number of regions after n generations of symmetrized Conant Gasket.at n=17A335703
• a(n) = A335703(2n+1).at n=8A337268