Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022098
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022098 Fibonacci sequence beginning 1 8. +0
5
1, 8, 9, 17, 26, 43, 69, 112, 181, 293, 474, 767, 1241, 2008, 3249, 5257, 8506, 13763, 22269, 36032, 58301, 94333, 152634, 246967, 399601, 646568, 1046169, 1692737, 2738906, 4431643, 7170549, 11602192 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n-1)=sum(P(8;n-1-k,k),k=0..ceiling((n-1)/2)), n>=1, with a(-1)=7. These are the SW-NE diagonals in P(8;n,k), the (8,1) Pascal triangle A093565. Observation by Paul Barry (pbarry(AT)wit.ie, Apr 29 2004. Proof via recursion relations and comparison of inputs.

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)= a(n-1)+a(n-2), n>=2, a(0)=1, a(1)=8. a(-1):=7.

G.f.: (1+7*x)/(1-x-x^2).

CROSSREFS

a(n) = A109754(7, n+1) = A101220(7, 0, n+1).

Sequence in context: A037371 A046790 A057111 this_sequence A129659 A041130 A041307

Adjacent sequences: A022095 A022096 A022097 this_sequence A022099 A022100 A022101

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.005 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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research