Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049868 a(n)=Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; 3 initial terms required. +0
1
1, 2, 2, 4, 7, 14, 26, 49, 91, 170, 317, 592, 1105, 2063, 3851, 7189, 13420, 25052, 46766, 87301, 162970, 304226, 567917, 1060165, 1979074, 3694457, 6896666, 12874423, 24033463, 44864717, 83751677, 156344314, 291857374 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=2*a(n-1)-a(n-3)+a(n-4); 4 initial terms required.

G.f.: (1-2x^2+x^3)/(1-2x+x^3-x^4). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 11 2003

Asymptotic to b*c^n, with b=0.617072414.., c=1.8667604.. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 11 2003

CROSSREFS

Adjacent sequences: A049865 A049866 A049867 this_sequence A049869 A049870 A049871

Sequence in context: A095325 A067953 A109070 this_sequence A120363 A118988 A049904

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research