login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265340 Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)). 5
0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 4, 4, 5, 5, 5, 5, 5, 4, 5, 4, 4, 5, 5, 5, 5, 5, 5, 6, 5, 6, 7, 6, 6, 7, 6, 5, 6, 6, 6, 7, 7, 6, 7, 6, 6, 6, 6, 6, 7, 7, 6, 7, 6, 5, 6, 6, 6, 7, 6, 6, 7, 6, 6, 6, 6, 6, 7, 7, 6, 7, 7, 6, 6, 6, 6, 7, 7, 6, 7, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Also the number of significant digits in the binary representation of A263273(n).
LINKS
FORMULA
a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).
a(0) = 0; for n >= 1, a(n) = A070939(A263273(n)).
a(n) = A265336(n) + A265337(n).
PROG
(Scheme, two variants)
(definec (A265340 n) (if (zero? n) 0 (+ 1 (A265340 (A265339 n)))))
(define (A265340 n) (if (zero? n) 0 (A070939 (A263273 n))))
CROSSREFS
Sequence in context: A271058 A107320 A095186 * A356993 A189631 A101402
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 18 2015
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 June 22 08:18 EDT 2024. Contains 373567 sequences. (Running on oeis4.)