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!)
A230405 a(n) = A000217(A230404(n+1)); the first differences of A219650. 6
1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 10, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Construction: Count the trailing zeros in the factorial base representation (A007623) of 2n+2 (2, 4, 6, 8, ...) and then take the corresponding triangular number from A000217.
LINKS
FORMULA
a(n) = A000217(A230404(n+1)).
a(n) = A219650(n+1) - A219650(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2. - Amiram Eldar, Jan 05 2024
PROG
(Scheme, two variants)
(define (A230405 n) (A000217 (A230404 (+ 1 n))))
(define (A230405 n) (- (A219650 (+ n 1)) (A219650 n)))
CROSSREFS
First differences of A219650. Can be used to compute A219650 and A230412.
Cf. also A230413.
Sequence in context: A353487 A356308 A228925 * A101685 A238737 A049653
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 31 2013
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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)