login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A265370 a(0) = 0; for n >= 1, a(n) = A070939(A078510(n)). 2
0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

Number of significant bits in the binary representation of n-th Spironacci number, A078510(n).

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..8192

FORMULA

a(0) = 0; for n >= 1, a(n) = A070939(A078510(n)).

PROG

(define (A265370 n) (if (zero? n) n (A070939 (A078510 n))))

CROSSREFS

Cf. A070939, A078510.

Cf. also A020909.

Sequence in context: A029837 A070939 A113473 * A238407 A196050 A122027

Adjacent sequences:  A265367 A265368 A265369 * A265371 A265372 A265373

KEYWORD

nonn

AUTHOR

Antti Karttunen, Dec 16 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 11:14 EDT 2019. Contains 324219 sequences. (Running on oeis4.)