Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116454
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116454 Smallest m such that A116452(m) = n. +0
3
0, 2, 9, 25, 59, 129, 271, 557, 1131, 2281, 4583, 9189, 18403, 36833, 73695, 147421, 294875, 589785, 1179607, 2359253, 4718547, 9437137, 18874319, 37748685, 75497419, 150994889, 301989831, 603979717, 1207959491, 2415919041 (list; graph; listen)
OFFSET

1,2

COMMENT

A116451(a(n)) = A116453(n);

Primes include a(2) = 2, a(5) = 59, a(7) = 271, a(8) = 557, a(10) = 2281, a(11) = 4583, a(14) = 36833. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Feb 20 2006

FORMULA

a(n+1) = (a(n) + n) * 2 + 1 for n>1.

CROSSREFS

Adjacent sequences: A116451 A116452 A116453 this_sequence A116455 A116456 A116457

Sequence in context: A097346 A053194 A005582 this_sequence A124633 A093122 A101051

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 16 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 October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research