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

%I #9 Jul 09 2017 16:18:07

%S 2,5,9,17,24,35,48,62,82,108,138,180,223,272,336,401,483,578,685,814,

%T 957,1113,1299,1502,1737,2004,2299,2633,3005,3420,3886,4400,4981,5618,

%U 6325,7108,7967,8927,9982,11134,12415,13805,15327,17006,18830,20841

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

%C Total number of elements in first n rows of A080738.

%H J. Bamberg, G. Cairns and D. Kilminster, <a href="http://www.jstor.org/stable/3647934">The crystallographic restriction, permutations and Goldbach's conjecture</a>, Amer. Math. Monthly, 110 (March 2003), 202-209.

%o (Haskell)

%o a080740 n k = a080740_list !! n

%o a080740_list = scanl1 (+) a080739_list -- _Reinhard Zumkeller_, Jun 13 2012

%Y Partial sums of A080739.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Mar 08 2003

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