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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079947 Partial sums of A030300. 3
 1, 1, 1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Kevin Ryde, Table of n, a(n) for n = 1..8192 FORMULA a(n) = (n+1+(2/3)*(4^e_4-1)+(-1)^e_2*(n-1-2*(4^e_4-1)))/2 where e_4=floor(log[4](n)) and e_2=floor(log[2](n))=floor(log[4](n^2)). - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003 a(n) = n - A079954(n).  Let k=A000523(n), then a(n) = n-A000975(k) if k even, or a(n) = A000975(k) if k odd. - Kevin Ryde, Jul 13 2019 PROG (PARI) a(n) = my(k=logint(n, 2), p=(2<

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.

Last modified May 13 19:36 EDT 2021. Contains 343868 sequences. (Running on oeis4.)