This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A116585 #13 Jun 09 2025 09:03:05
%S A116585 0,1,1,2,2,2,8,4,5,34,9,14,144,21,36,610,49,95,2584,114,250,10946,265,
%T A116585 657,46368,616,1728,196418,1432,4544,832040,3329,11949,3524578,7739,
%U A116585 31422,14930352,17991,82629,63245986,41824,217286,267914296,97229,571388,1134903170
%N A116585 An interleaving of three sequences: a(3n) = A000045(3n) = A014445(n). a(3n+1) = A000931(3n+5) = A052921(n). a(3n+2) = A003269(3n-1).
%H A116585 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PisotNumber.html">Pisot Number</a>.
%H A116585 <a href="/index/Rec#order_27">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,8,0,0,-17,0,0,1,0,0,11,0,0,15,0,0,2,0,0,3,0,0,5,0,0,1).
%t A116585 a[1, 0] = 0; a[1, 1] = 1; a[1, n_Integer?Positive] := a[1, n] = a[1, n - 1] + a[1, n - 2] a[2, 0] = 0; a[2, 1] = 1; a[2, 2] = 1; a[2, n_Integer?Positive] := a[2, n] = a[2, n - 2] + a[2, n - 3] a[3, 0] = 0; a[3, 1] = a[3, 2] = a[3, 3] = 1; a[3, n_Integer?Positive] := a[3, n] = a[3, n - 1] + a[3, n - 4] b = Table[a[1 + Mod[n, 3], n], {n, 0, 25}]
%Y A116585 Cf. A000045, A000073, A000931, A003269, A014445, A017898, A052921.
%K A116585 nonn,easy
%O A116585 0,4
%A A116585 _Roger L. Bagula_, Mar 26 2006
%E A116585 Edited by _N. J. A. Sloane_, Apr 09 2008
%E A116585 More terms from _Amiram Eldar_, Jun 09 2025