23659

Appears in sequences

• Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.at n=18A016067
• Smallest integer that can be expressed as p+2m^2 in more ways than any smaller number, where m >= 0 and p = 1 or prime.at n=39A055202
• Expansion of x(2 + 5x - x^2)/((1 - x)(1 - 6x + x^2)).at n=5A082291
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k returns (i.e., down steps hitting the x-axis).at n=59A097612
• Shifts left when Euler transform applied 8 times.at n=7A144040
• a(n) = 729*n^2 - 442*n + 67.at n=5A157668
• a(n) = 676*n - 1.at n=34A158393
• Row sums of A181657.at n=21A181658
• G.f.: Sum_{n>=0} Product_{k=1..n} ((1+x)^(2*k-1) - 1)/(1 - x^(2*k-1)).at n=6A207654
• Numbers k such that (26*10^k - 77)/3 is prime.at n=21A282810
• a(n) = (3*b(n) + b(n-1) + 1)/2, where b = A005409.at n=10A328990