login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A061390
Use same rules as
A047988
. Sequence gives smallest numbers which require n steps to reach 2.
0
3, 5, 7, 14, 38, 172, 823, 6185, 87223, 1940494
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,1
COMMENTS
Some values calculated by Joseph Devincentis.
a(11) > 5000000. -
David Wasserman
, Jun 21 2002
LINKS
Table of n, a(n) for n=1..10.
Erich Friedman,
Math. Magic
CROSSREFS
Cf.
A047984
.
Sequence in context:
A309832
A319784
A346503
*
A227685
A051445
A002181
Adjacent sequences:
A061387
A061388
A061389
*
A061391
A061392
A061393
KEYWORD
nonn
,
more
AUTHOR
Jason Earls
, Jun 09 2001
EXTENSIONS
More terms from
David Wasserman
, Jun 21 2002
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified May 2 17:46 EDT 2024. Contains 372203 sequences. (Running on oeis4.)