login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182651 Algorithm: x->[rx] if x even, x->[x/r] if x odd, where r = sqrt(2); a(n) is the number of steps from n to 2. 3
1, 1, 1, 3, 2, 7, 4, 6, 8, 12, 5, 16, 9, 11, 13, 15, 17, 19, 10, 14, 12, 14, 16, 18, 18, 30, 11, 13, 15, 17, 13, 15, 17, 21, 19, 29, 31, 33, 12, 37, 14, 16, 18, 22, 14, 16, 18, 20, 22, 28, 30, 32, 32, 36, 34, 36, 38, 42, 15, 54, 19, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..62.

EXAMPLE

4->[4r]=5 (step 1)

5->[5/r]=3 (step 2)

3->[3/r]=2 (step 3),

so that a(4)=3.

CROSSREFS

Cf. A182649, A182650, A182652.

Sequence in context: A344878 A344875 A178910 * A175055 A085168 A327119

Adjacent sequences:  A182648 A182649 A182650 * A182652 A182653 A182654

KEYWORD

nonn

AUTHOR

Clark Kimberling, Nov 26 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 17:11 EDT 2021. Contains 348233 sequences. (Running on oeis4.)