Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129300
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129300 a(0)=1. a(n) = a(n-1) + (sum of the terms of the sequence which are <= n). +0
2
1, 2, 5, 8, 11, 19, 27, 35, 51, 67, 83, 110, 137, 164, 191, 218, 245, 272, 299, 345, 391, 437, 483, 529, 575, 621, 667, 740, 813, 886, 959, 1032, 1105, 1178, 1251, 1359, 1467, 1575, 1683, 1791, 1899, 2007, 2115, 2223, 2331, 2439, 2547, 2655, 2763, 2871, 2979 (list; graph; listen)
OFFSET

0,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

The terms that are <= 9 are a(0) through a(3). So a(9) = a(8) + a(0)+a(1)+a(2)+a(3) = 51 + 1+2+5+8 = 67.

MAPLE

a[0]:=1: for n from 1 to 60 do b:=0: for j from 0 to n-1 do if a[j]<=n then b:=b+a[j] else fi od: a[n]:=a[n-1]+b: od: seq(a[n], n=0..60); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 12 2007

CROSSREFS

Cf. A129299, A126022, A095114.

Sequence in context: A130258 A032765 A154484 this_sequence A107679 A018846 A056661

Adjacent sequences: A129297 A129298 A129299 this_sequence A129301 A129302 A129303

KEYWORD

nonn

AUTHOR

Leroy Quet Apr 08 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 12 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research