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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081929 Sum of the n-th row of A077339. 0
1, 22, 64, 127, 211, 316, 442, 589, 757, 946, 1156, 2467, 3979, 5692, 7606, 9721, 12037, 14554, 17272, 20191, 23311, 26632, 30154, 33877, 37801, 41926, 46252, 50779, 55507, 60436, 65566, 70897, 76429, 82162, 88096, 94231, 100567, 107104 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
For n>10, a(n) = 1/2 * (201n^2 - 2001n + 2).
From Chai Wah Wu, Jan 12 2023: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 13.
G.f.: x*(900*x^12 - 1080*x^11 - x^2 - 19*x - 1)/(x - 1)^3. (End)
CROSSREFS
Not the same as A069178 (A069178(12)=1387 <> 2467=a(12) ). Cf. A077339, A077340.
Sequence in context: A051874 A140390 A069178 * A305064 A124715 A126376
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Apr 01 2003
EXTENSIONS
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
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 December 7 12:41 EST 2023. Contains 367656 sequences. (Running on oeis4.)