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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129895 a(1)=1. a(n) = a(n-1) + number of triangular numbers among the first (n-1) terms of the sequence. 1
1, 2, 3, 5, 7, 9, 11, 13, 15, 18, 21, 25, 29, 33, 37, 41, 45, 50, 55, 61, 67, 73, 79, 85, 91, 98, 105, 113, 121, 129, 137, 145, 153, 162, 171, 181, 191, 201, 211, 221, 231, 242, 253, 265, 277, 289, 301, 313, 325, 338, 351, 365, 379, 393, 407, 421, 435, 450, 465, 481 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

For k=1,3: a(8*n+k) = (4*n+k)*(2*n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 20 2007

MAPLE

T := {seq((1/2)*j*(j+1), j = 1 .. 40)}: a[1] := 1; for n from 2 to 60 do a[n] := a[n-1]+nops(`intersect`(T, {seq(a[i], i = 1 .. n-1)})) end do: seq(a[n], n = 1 .. 60); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007

CROSSREFS

Cf. A097602.

Sequence in context: A185603 A046654 A023543 * A096149 A033055 A186390

Adjacent sequences:  A129892 A129893 A129894 * A129896 A129897 A129898

KEYWORD

nonn

AUTHOR

Leroy Quet Jun 04 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 21 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:50 EST 2012. Contains 205904 sequences.