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 A048626 #16 Aug 08 2016 17:18:26
%S A048626 6,9,13,19,28,41,60,88,129,189,277,406,595,872,1278,1873,2745,4023,
%T A048626 5896,8641,12664,18560,27201,39865,58425,85626,125491,183916,269542,
%U A048626 395033,578949,848491,1243524,1822473,2670964,3914488,5736961,8407925,12322413,18059374
%N A048626 Pisot sequence P(6,9).
%H A048626 Colin Barker, <a href="/A048626/b048626.txt">Table of n, a(n) for n = 0..1000</a>
%H A048626 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1).
%F A048626 a(n) = a(n-1) + a(n-3) (Checked up to n = 1000)
%F A048626 a(n) = A048625(n+1). - _R. J. Mathar_, Oct 15 2008
%t A048626 LinearRecurrence[{1, 0, 1}, {6, 9, 13}, 42] (* _Robert G. Wilson v_, Jul 12 2014 *)
%o A048626 (PARI) pisotP(nmax, a1, a2) = {
%o A048626 a=vector(nmax); a[1]=a1; a[2]=a2;
%o A048626 for(n=3, nmax, a[n] = ceil(a[n-1]^2/a[n-2]-1/2));
%o A048626 a
%o A048626 }
%o A048626 pisotP(50, 6, 9) \\ _Colin Barker_, Aug 08 2016
%Y A048626 Subsequence of A048625, A000930. See A008776 for definitions of Pisot sequences.
%Y A048626 Cf. A020721.
%K A048626 nonn
%O A048626 0,1
%A A048626 _David W. Wilson_