Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133847
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133847 a(n)a(n-9)=a(n-1)a(n-8)+a(n-4)+a(n-5) with initial terms a(1)=...=a(9)=1. +0
1
1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 5, 7, 9, 13, 21, 33, 49, 169, 293, 421, 553, 823, 1365, 2179, 3265, 11289, 19585, 28153, 36993, 55081, 91393, 145929, 218689, 756163, 1311861, 1885783, 2477929, 3689557, 6121925, 9775033, 14648881, 50651601, 87875061 (list; graph; listen)
OFFSET

1,10

LINKS

P. Heideman and E. Hogan, A New Family of Somos-Like Recurrences

FORMULA

Sequence also generated by the linear recurrence 68*(u(n-8)-u(n-16))+u(n-24) with the initial 24 terms given by the quadratic recurrence.

MAPLE

a := proc(n) option remember; if n<=9 then RETURN(1); else RETURN((a(n-1)*a(n-8)+a(n-4)+a(n-5))/a(n-9)); fi; end;

CROSSREFS

Sequence in context: A121259 A089228 A126278 this_sequence A134180 A107220 A098758

Adjacent sequences: A133844 A133845 A133846 this_sequence A133848 A133849 A133850

KEYWORD

easy,nonn

AUTHOR

Emilie Hogan (eahogan(AT)math.rutgers.edu), Sep 26 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research