Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129299
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129299 a(1)=1. a(n) = a(n-1) + (sum of the earlier terms of the sequence which are <= n). +0
2
1, 2, 5, 8, 16, 24, 32, 48, 64, 80, 96, 112, 128, 144, 160, 192, 224, 256, 288, 320, 352, 384, 416, 472, 528, 584, 640, 696, 752, 808, 864, 952, 1040, 1128, 1216, 1304, 1392, 1480, 1568, 1656, 1744, 1832, 1920, 2008, 2096, 2184, 2272, 2408, 2544, 2680, 2816 (list; graph; listen)
OFFSET

1,2

LINKS

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

EXAMPLE

The terms that are <= 9 are a(1) through a(4). So a(9) = a(8) + a(1)+a(2)+a(3)+a(4) = 48 + 1+2+5+8 = 64.

MAPLE

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

CROSSREFS

Cf. A129300, A126022, A095114.

Sequence in context: A065618 A080084 A065093 this_sequence A096541 A137685 A093065

Adjacent sequences: A129296 A129297 A129298 this_sequence A129300 A129301 A129302

KEYWORD

nonn

AUTHOR

Leroy Quet Apr 08 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 10 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research