cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A080740 #9 Jul 09 2017 16:18:07
%S A080740 2,5,9,17,24,35,48,62,82,108,138,180,223,272,336,401,483,578,685,814,
%T A080740 957,1113,1299,1502,1737,2004,2299,2633,3005,3420,3886,4400,4981,5618,
%U A080740 6325,7108,7967,8927,9982,11134,12415,13805,15327,17006,18830,20841
%N A080740 a(n) = number of m such that A080737(m) <= 2n.
%C A080740 Total number of elements in first n rows of A080738.
%H A080740 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 A080740 (Haskell)
%o A080740 a080740 n k = a080740_list !! n
%o A080740 a080740_list = scanl1 (+) a080739_list  -- _Reinhard Zumkeller_, Jun 13 2012
%Y A080740 Partial sums of A080739.
%K A080740 nonn,easy
%O A080740 0,1
%A A080740 _N. J. A. Sloane_, Mar 08 2003
%E A080740 More terms from Devin Kilminster (devin(AT)maths.uwa.edu.au), Mar 10 2003