This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001510 From a slowly converging series. (Formerly M1301 N0499) 0
 1, 2, 4, 24, 1104, 2435424, 11862575248704, 281441383062305809756861824, 158418504200047111075388369241884118003210485743490304 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 REFERENCES N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437. H. E. Salzer, The approximation of numbers as sums of reciprocals, Amer. Math. Monthly, 54 (1947), 135-142. FORMULA Apparently a(n+2) = A002715(2*n) + 1. - R. J. Mathar, Apr 23 2007 MATHEMATICA (* a5 = A002715 *) a5[n_?OddQ] := a5[n] = 2*a5[n-1] + 1; a5[n_?EvenQ] := a5[n] = (a5[n-1]^2 - 3)/2; a5[0] = 3; a[n_] := a5[2*n - 4] + 1; a[0] = 1; a[1] = 2; Table[a[n], {n, 0, 8}] (* Jean-François Alcover, Jan 25 2013, after R. J. Mathar *) CROSSREFS Sequence in context: A296787 A128299 A143672 * A103099 A266495 A119029 Adjacent sequences:  A001507 A001508 A001509 * A001511 A001512 A001513 KEYWORD nonn,nice AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 15:07 EST 2019. Contains 329979 sequences. (Running on oeis4.)