Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133854 a(n)a(n-13)=a(n-1)a(n-12)+a(n-6)+a(n-7) with initial terms a(1)=...=a(13)=1. +0
1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 5, 7, 9, 11, 13, 17, 25, 37, 53, 73, 97, 321, 549, 781, 1017, 1257, 1501, 1995, 2985, 4471, 6453, 8931, 11905, 39433, 67457, 95977, 124993, 154505, 184513, 245273, 367041, 549817, 793601, 1098393, 1464193, 4849891 (list; graph; listen)
OFFSET

1,14

LINKS

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

FORMULA

Sequence also generated by the linear recurrence 124*(u(n-12)-u(n-24))+u(n-36) with the initial 36 terms given by the quadratic recurrence.

MAPLE

a := proc(n) option remember; if n<=13 then RETURN(1); else RETURN((a(n-1)*a(n-12)+a(n-6)+a(n-7))/a(n-13)); fi; end;

CROSSREFS

Sequence in context: A080429 A050150 A062090 this_sequence A030155 A143448 A039786

Adjacent sequences: A133851 A133852 A133853 this_sequence A133855 A133856 A133857

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research