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!)
A163867 a(n) = a(floor(n/3)) + a(floor(2*n/3)); a(0) = 1. 1
1, 2, 3, 5, 5, 7, 8, 8, 10, 13, 13, 13, 15, 15, 18, 20, 20, 20, 23, 23, 23, 26, 26, 28, 30, 30, 30, 36, 36, 36, 36, 36, 39, 39, 39, 41, 45, 45, 45, 45, 45, 51, 54, 54, 54, 56, 56, 56, 59, 59, 59, 59, 59, 61, 68, 68, 68, 68, 68, 68, 68, 68, 74, 80, 80, 80, 80, 80, 82, 84, 84, 84 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Sungjin Kim, Mathematics Stack Exchange Question 3051676 (showing a(n)/n converges).
FORMULA
G.f. g(x) satisfies g(x) = -1 + (1 + x + x^2) g(x^3) + (1 + x^(1/2) + x) g(x^(3/2))/2 + (1 - x^(1/2) + x) g(-x^(3/2))/2. - Robert Israel, Apr 22 2016
MAPLE
a:= proc(n) option remember; procname(floor(n/3)) + procname(floor(2*n/3)) end proc:
a(0):= 1:
seq(a(n), n=0..100); # Robert Israel, Apr 22 2016
MATHEMATICA
a[0]=1; a[n_]:=a[n]=a[Floor[n/3]]+a[Floor[(2n)/3]]; Array[a, 80, 0] (* Harvey P. Dale, Jun 08 2018 *)
PROG
(PARI) a(n)={if(n==0, 1, a(n\3) + a(2*n\3))} \\ Andrew Howroyd, Feb 27 2018
CROSSREFS
Sequence in context: A323185 A168065 A077724 * A077381 A225636 A023838
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 06 2009
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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)