

A080740


a(n) = number of m such that A080737(m) <= 2n.


5



2, 5, 9, 17, 24, 35, 48, 62, 82, 108, 138, 180, 223, 272, 336, 401, 483, 578, 685, 814, 957, 1113, 1299, 1502, 1737, 2004, 2299, 2633, 3005, 3420, 3886, 4400, 4981, 5618, 6325, 7108, 7967, 8927, 9982, 11134, 12415, 13805, 15327, 17006, 18830, 20841
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

Total number of elements in first n rows of A080738.


REFERENCES

J. Bamberg, G. Cairns and D. Kilminster, The crystallographic restriction, permutations and Goldbach's conjecture, Amer. Math. Monthly, 110 (March 2003), 202209.


LINKS

Table of n, a(n) for n=0..45.


PROG

(Haskell)
a080740 n k = a080740_list !! n
a080740_list = scanl1 (+) a080739_list  Reinhard Zumkeller, Jun 13 2012


CROSSREFS

Partial sums of A080739.
Sequence in context: A059529 A119676 A036711 * A123324 A167887 A023603
Adjacent sequences: A080737 A080738 A080739 * A080741 A080742 A080743


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane, Mar 08 2003


EXTENSIONS

More terms from Devin Kilminster (devin(AT)maths.uwa.edu.au), Mar 10 2003


STATUS

approved



