[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174985
Start with n, iterate the map k -> A167507(k) until we reach 3, 4, 5 or 6; a(n) = number of steps required.
2
2, 3, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 3, 4, 4, 4, 3, 4, 4, 4
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Table of n, a(n) for n=1..100.
CROSSREFS
Cf. A167507, A174984, A174987.
Sequence in context: A122402 A179008 A255252 * A008406 A039735 A283761
Adjacent sequences: A174982 A174983 A174984 * A174986 A174987 A174988
KEYWORD
nonn,word
AUTHOR
Jacques ALARDET, Apr 03 2010
EXTENSIONS
Edited by N. J. A. Sloane, Apr 05 2010
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 03:49 EST 2024. Contains 377523 sequences.
License Agreements, Terms of Use, Privacy Policy