Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127904
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127904 Smallest m such that A008687(m) = n. +0
3
0, 1, 3, 5, 9, 17, 33, 65, 129, 257, 513, 1025, 2049, 4097, 8193, 16385, 32769, 65537, 131073, 262145, 524289, 1048577, 2097153, 4194305, 8388609, 16777217, 33554433, 67108865, 134217729, 268435457, 536870913, 1073741825, 2147483649 (list; graph; listen)
OFFSET

0,3

COMMENT

A008687(a(n)) = n and A008687(m) < n for m < a(n);

for n>1: a(n) = A000051(n-1) = 2^(n-1) + 1.

CROSSREFS

Sequence in context: A074860 A135728 A083318 this_sequence A048578 A087312 A099170

Adjacent sequences: A127901 A127902 A127903 this_sequence A127905 A127906 A127907

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 05 2007

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