login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003009 a(n+1) = a(n) + 4^(n-1) a(n)^2.
(Formerly M3174)
2
3, 147, 1383123, 489735485064147, 245597025618959718190041238775763, 247062114274836300381127305147102564467751924522387062291401805739987 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=3..8.

James S. Hall, A remark on the primeness of Mersenne numbers, J. London Math. Soc. 28, (1953), 285-287.

D. H. Lehmer. Mathematical Reviews.  Review of: Hall, James S. A remark on the primeness of Mersenne numbers. (1953) [Annotated scanned copy]

MATHEMATICA

RecurrenceTable[{a[3]==3, a[n]==a[n-1]+4^(n-2) a[n-1]^2}, a, {n, 3, 10}] (* Harvey P. Dale, Jan 29 2014 *)

CROSSREFS

Sequence in context: A203312 A203742 A203699 * A037122 A213989 A181748

Adjacent sequences:  A003006 A003007 A003008 * A003010 A003011 A003012

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 5 06:46 EDT 2020. Contains 336209 sequences. (Running on oeis4.)