Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072639 a(0) = 0, a(n) = sum_{i=0}^{n-1} 2^((2^i)-1). +0
5
0, 1, 3, 11, 139, 32907, 2147516555, 9223372039002292363, 170141183460469231740910675754886398091, 57896044618658097711785492504343953926805133516280751251469702679711451218059 (list; graph; listen)
OFFSET

0,3

COMMENT

Maximum position in A072644 where the value n occurs.

Also partial sums of A058891, i.e. the first differences are there. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 15 2007

MAPLE

A072639 := proc(n) local i; add(2^((2^i)-1), i=0..(n-1)); end;

CROSSREFS

Binary width of each term: A000079. Cf. A072638, A072640, A072654.

Cf. A058891.

Adjacent sequences: A072636 A072637 A072638 this_sequence A072640 A072641 A072642

Sequence in context: A121897 A067657 A063502 this_sequence A100459 A010682 A080987

KEYWORD

nonn

AUTHOR

Antti Karttunen Jun 02 2002

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research