Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128610
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128610 a(0)=a(1)=1. For n>=2, a(n) = a(n-2) + a(n-1) + (number of terms from among {a(0),a(1),a(2),...a(n-1)} which are <= n). +0
2
1, 1, 4, 7, 14, 24, 41, 69, 114, 187, 305, 496, 805, 1305, 2115, 3425, 5545, 8975, 14525, 23505, 38035, 61545, 99585, 161135, 260726, 421867, 682599, 1104472, 1787077, 2891555, 4678638, 7570199, 12248843, 19819048, 32067897, 51886951, 83954854 (list; graph; listen)
OFFSET

0,3

LINKS

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

EXAMPLE

There are 4 terms among the terms {a(0),a(1),a(2),...a(8)} which are <= 9. So a(9) = a(7) + a(8) + 4 = 69 + 114 + 4 = 187.

MAPLE

a[0]:=1:a[1]:=1: for n from 2 to 42 do ct:=2: for j from 2 to n-1 do if a[j]<=n then ct:=ct+1 else fi od: a[n]:=a[n-1]+a[n-2]+ct od: seq(a[n], n=0..42); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 09 2007

CROSSREFS

Sequence in context: A048241 A003404 A139025 this_sequence A094968 A049946 A076975

Adjacent sequences: A128607 A128608 A128609 this_sequence A128611 A128612 A128613

KEYWORD

nonn

AUTHOR

Leroy Quet May 08 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 09 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research