login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A053206
Row sums of A053203.
2
2, 0, 6, 6, 2, 0, 14, 0, 30, 36, 46, 0, 26, 0, 54, 48, 46, 0, 110, 30, 54, 78, 126, 0, 212, 0, 222, 72, 2, 86, 134, 0, 78, 84, 214, 0, 398, 0, 278, 330, 278, 0, 542, 126, 222, 414, 378, 0, 620, 96, 590, 120, 350, 0, 734, 0, 870, 384, 894, 290, 458, 0, 150, 558, 742, 0, 1142
OFFSET
6,1
LINKS
FORMULA
a(n) = A053204(n) - n*((n+1) mod 2) - 2.
a(prime(n)) = 0, where prime(n) is the n-th prime.
EXAMPLE
a(6) = 3 + 0 + 0 + 3 = 6.
PROG
(Haskell)
a053206 = sum . a053203_row -- Reinhard Zumkeller, Jan 24 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Asher Auel, Dec 12 1999
EXTENSIONS
Corrected and extended by James A. Sellers, Dec 13 1999
STATUS
approved