Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061390 Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2. +0
1
3, 5, 7, 14, 38, 172, 823, 6185, 87223, 1940494 (list; graph; listen)
OFFSET

1,1

COMMENT

Some values calculated by Joseph Devincentis.

a(11) > 5000000. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 2002

LINKS

Erich Friedman, Math. Magic

CROSSREFS

Cf. A047984.

Sequence in context: A118743 A114980 A024372 this_sequence A051445 A002181 A073692

Adjacent sequences: A061387 A061388 A061389 this_sequence A061391 A061392 A061393

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 09 2001

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research