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 A000383 M4088 N1697 #66 Jan 05 2025 19:51:31
%S A000383 1,1,1,1,1,1,6,11,21,41,81,161,321,636,1261,2501,4961,9841,19521,
%T A000383 38721,76806,152351,302201,599441,1189041,2358561,4678401,9279996,
%U A000383 18407641,36513081,72426721,143664401,284970241,565262081,1121244166,2224080691,4411648301
%N A000383 Hexanacci numbers with a(0) = ... = a(5) = 1.
%D A000383 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000383 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000383 Indranil Ghosh, <a href="/A000383/b000383.txt">Table of n, a(n) for n = 0..3358</a> (terms 0..200 from T. D. Noe)
%H A000383 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>
%H A000383 B. G. Baumgart, Letter to the editor <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/2-4/baumgart-a.pdf">Part 1</a> <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/2-4/baumgart-b.pdf">Part 2</a> <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/2-4/baumgart-c.pdf">Part 3</a>, Fib. Quart. 2 (1964), 260, 302.
%H A000383 Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H A000383 Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992
%H A000383 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1).
%F A000383 G.f. ( -1+x^2+2*x^3+3*x^4+4*x^5 ) / ( -1+x+x^2+x^3+x^4+x^5+x^6 ). - _R. J. Mathar_, Oct 11 2011
%p A000383 A000383:=(-1+z**2+2*z**3+3*z**4+4*z**5)/(-1+z**2+z**3+z**4+z**5+z+z**6); # _Simon Plouffe_ in his 1992 dissertation
%p A000383 a:= n-> (Matrix([[1$6]]). Matrix(6, (i,j)-> if (i=j-1) or j=1 then 1 else 0 fi)^n)[1,6]: seq(a(n), n=0..28); # _Alois P. Heinz_, Aug 26 2008
%t A000383 LinearRecurrence[{1,1,1,1,1,1},{1,1,1,1,1,1},50] (* _Harvey P. Dale_, Oct 30 2013 *)
%o A000383 (PARI) a(n)=([0,1,0,0,0,0; 0,0,1,0,0,0; 0,0,0,1,0,0; 0,0,0,0,1,0; 0,0,0,0,0,1; 1,1,1,1,1,1]^n*[1;1;1;1;1;1])[1,1] \\ _Charles R Greathouse IV_, Sep 24 2015
%Y A000383 Cf. A060455.
%Y A000383 Cf. A001592 (Hexanacci numbers with a(0) = ... = a(4) = 0 and a(5)=1).
%Y A000383 Cf. A247192 (indices of primes in this sequence).
%Y A000383 Cf. A249413 (primes in this sequence).
%K A000383 nonn,easy
%O A000383 0,7
%A A000383 _N. J. A. Sloane_