The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272038 Somos's sequence {b(9,n)} defined in comment in A078495: a(0)=a(1)=...=a(20)=1; for n>=21, a(n)=(a(n-1)*a(n-20)+a(n-10)*a(n-11))/a(n-21). 1
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 19, 31, 51, 81, 123, 179, 251, 341, 451, 1045, 1691, 2451, 3459, 4977, 7467, 11679, 18755, 30349, 48763, 100474, 282777, 679512, 1391391, 2547414, 4327101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,22 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..578 PROG (Ruby) def b(k, n) b = Array.new(2 * k + 3, 1) (2 * k + 3..n).each{|i| j = (b[i - 1] * b[i - 2 * k - 2] + b[i - k - 1] * b[i - k - 2]) / b[i - 2 * k - 3].to_r j = j.to_i if j.denominator == 1 b[i] = j } b[0..n] end p b(9, n) # Seiichi Manyama, May 04 2016 CROSSREFS Cf. A006721, A078495, A268199, A271954, A271948, A271949, A271950, A271952, A271955. Sequence in context: A332166 A017904 A143290 * A044961 A044823 A048309 Adjacent sequences: A272035 A272036 A272037 * A272039 A272040 A272041 KEYWORD nonn AUTHOR Vladimir Shevelev and Peter J. C. Moses, Apr 18 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 16:00 EST 2022. Contains 358644 sequences. (Running on oeis4.)