Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119571 a(n) = 2^(2^n - 1) + 2^(2^(n + 1) - 1) + 1. +0
1
4, 11, 137, 32897, 2147516417, 9223372039002259457, 170141183460469231740910675752738881537, 57896044618658097711785492504343953926805133516280751251460479307672448925697 (list; graph; listen)
OFFSET

0,1

COMMENT

Fermat-like sequence of powers of two.

FORMULA

a(n) = A058891(n+1)+A058891(n+2)+1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 22 2007

MATHEMATICA

aa = Table[2^(2^n - 1) + 2^(2^(n + 1) - 1) + 1, {n, 0, 10}]

CROSSREFS

Sequence in context: A055979 A018242 A006248 this_sequence A089920 A118197 A092658

Adjacent sequences: A119568 A119569 A119570 this_sequence A119572 A119573 A119574

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 31 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 03 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research