Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022099 Fibonacci sequence beginning 1 9. +0
4
1, 9, 10, 19, 29, 48, 77, 125, 202, 327, 529, 856, 1385, 2241, 3626, 5867, 9493, 15360, 24853, 40213, 65066, 105279, 170345, 275624, 445969, 721593, 1167562, 1889155, 3056717, 4945872, 8002589 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n-1)=sum(P(9;n-1-k,k),k=0..ceiling((n-1)/2)), n>=1, with a(-1)=8. These are the SW-NE diagonals in P(9;n,k), the (9,1) Pascal triangle A093644. 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)=9. a(-1):=8.

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

CROSSREFS

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

Adjacent sequences: A022096 A022097 A022098 this_sequence A022100 A022101 A022102

Sequence in context: A110939 A015898 A050551 this_sequence A042113 A041166 A042613

KEYWORD

nonn

AUTHOR

njas

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 May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research