login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089649 a(1)=1, a(2)=2, a(n) = a(n-1) + a(floor((n+1)/3)). 3
1, 2, 3, 4, 6, 8, 10, 13, 16, 19, 23, 27, 31, 37, 43, 49, 57, 65, 73, 83, 93, 103, 116, 129, 142, 158, 174, 190, 209, 228, 247, 270, 293, 316, 343, 370, 397, 428, 459, 490, 527, 564, 601, 644, 687, 730, 779, 828, 877, 934, 991, 1048, 1113, 1178, 1243, 1316, 1389 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Partial sums of the sequence: a(1)=1, a(1), a(1), a(1), a(2), a(2), a(2), a(3), a(3), ... each term repeated 3 times.

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..10000

MATHEMATICA

Fold[Append[#1, #1[[-1]] + #1[[Quotient[#2 + 1, 3]]]] &, {1, 2}, Range[3, 57]] (* Ivan Neretin, Nov 25 2016 *)

PROG

(PARI) a(n)=if(n<2, 1, a(n-1)+a(floor((n+1)/3)))

CROSSREFS

Cf. A005704, A089650.

Sequence in context: A025694 A022796 A008748 * A049700 A002984 A109965

Adjacent sequences:  A089646 A089647 A089648 * A089650 A089651 A089652

KEYWORD

nonn

AUTHOR

Philippe Deléham, Jan 02 2004

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 04:57 EDT 2019. Contains 328145 sequences. (Running on oeis4.)