19720

Appears in sequences

• Number of partitions of n into at most 9 parts.at n=43A008638
• Number of partitions of n in which the greatest part is 9.at n=52A026815
• a(n) = (n-3)*A006918(n-2)/2 for n >= 2, with a(0) = a(1) = 0.at n=32A038376
• Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=28A046762
• Partial sums of A007585.at n=14A051797
• Number of primitive (period n) periodic palindromic structures using a maximum of three different symbols.at n=20A056514
• Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.at n=13A066290
• Let P(n,x) = Product_{k=1..n} polcyclo(k,x) where polcyclo(k,x) denotes the k-th cyclotomic polynomial. Sequence gives the maximum value of coefficients of P(n,x).at n=17A076584
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=6.at n=32A076672
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=28A076673
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=28A076675
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=26A076676
• First differences of A014292.at n=29A104862
• a(n) = 4*n^3 + 4*n.at n=17A105374
• Triangle read by rows: row n gives coefficients C(n,j) for a Sheffer sequence (binomial-type) with raising operator -x { 1 + W[ -exp(-2) * (2+D) ] } where W is the Lambert W multi-valued function.at n=38A135338
• Coefficients of the second order mock theta function B(q).at n=36A153140
• 8 times octagonal numbers: 8*n*(3*n-2).at n=29A153808
• 5^n + 4^n - 1.at n=6A155616
• Number of n X 4 binary arrays without the pattern 0 1 diagonally or vertically.at n=20A188838
• G.f.: real part of 1/(1 - i*x - i*x^2) where i=sqrt(-1).at n=28A201837