The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A277822 a(n) = index of the column where n is located in array A277880. 8
0, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 7, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Ordinal transform of A277813.
a(n) = 1 + the number of iterations of map k -> A003188(A006068(k)/2) that are required (when starting from k = n) until k is an odious number.
LINKS
FORMULA
a(0) = 0, for n >= 1, a(n) = 1 + (A010059(n)*A001511(n)).
a(0) = 0, for n >= 1, if A010060(n) = 1 [when n is one of the odious numbers, A000069], then a(n) = 1, otherwise a(n) = 1 + a(A003188(A006068(n)/2)).
Other identities. For all n >= 1:
a(n) = 1 + a(floor(n/2)) when A010060(n) = 0.
a(n) = 1+A277808(n).
PROG
(Scheme, with memoization-macro definec)
(definec (A277822 n) (cond ((zero? n) n) ((= 1 (A010060 n)) 1) (else (+ 1 (A277822 (A003188 (/ (A006068 n) 2)))))))
;; Other implementations:
(definec (A277822 n) (cond ((zero? n) n) ((= 1 (A010060 n)) 1) (else (+ 1 (A277822 (floor->exact (/ n 2)))))))
(define (A277822 n) (+ 1 (* (A010059 n) (A001511 n))))
CROSSREFS
One more than A277808.
Sequence in context: A131794 A145726 A322984 * A327616 A181631 A348390
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Nov 03 2016
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 30 15:08 EDT 2024. Contains 372968 sequences. (Running on oeis4.)