The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024865 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000027, t = A023533. 1
 0, 0, 1, 2, 3, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,4 LINKS G. C. Greubel, Table of n, a(n) for n = 2..5000 MATHEMATICA A023533[n_]:= A023533[n]= If[Binomial[Floor[Surd[6*n-1, 3]] +2, 3] != n, 0, 1]; A024865[n_]:= A024865[n]= Sum[j*A023533[n-j+1], {j, Floor[n/2]}]; Table[A024865[n], {n, 2, 130}] (* G. C. Greubel, Sep 07 2022 *) PROG (Magma) A023533:= func< n | Binomial(Floor((6*n-1)^(1/3)) +2, 3) ne n select 0 else 1 >; A024865:= func< n | (&+[k*A023533(n+1-k): k in [1..Floor(n/2)]]) >; [A024865(n): n in [2..130]]; // G. C. Greubel, Sep 07 2022 (SageMath) @CachedFunction def A023533(n): return 0 if (binomial( floor( (6*n-1)^(1/3) ) +2, 3) != n) else 1 def A024865(n): return sum(k*A023533(n-k+1) for k in (1..(n//2))) [A024865(n) for n in (2..130)] # G. C. Greubel, Sep 07 2022 CROSSREFS Cf. A000027, A023533. Sequence in context: A056966 A037846 A037882 * A025109 A348710 A048735 Adjacent sequences: A024862 A024863 A024864 * A024866 A024867 A024868 KEYWORD nonn AUTHOR 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.

Last modified March 22 01:15 EDT 2023. Contains 361413 sequences. (Running on oeis4.)