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 A048586 #13 Oct 25 2023 09:28:28 %S A048586 6,8,11,16,24,36,54,81,122,184,278,421,638,967,1466,2223,3371,5112, %T A048586 7753,11759,17835,27051,41030,62233,94394,143176,217169,329402,499638, %U A048586 757853,1149515,1743590,2644686,4011473,6084623,9229188,13998881,21233577,32207203 %N A048586 Pisot sequence L(6,8). %H A048586 Colin Barker, <a href="/A048586/b048586.txt">Table of n, a(n) for n = 0..1000</a> %H A048586 <a href="/index/Ph#Pisot">Index entries for Pisot sequences</a> %p A048586 L := proc(a0,a1,n) %p A048586 option remember; %p A048586 if n = 0 then %p A048586 a0 ; %p A048586 elif n = 1 then %p A048586 a1; %p A048586 else %p A048586 ceil( procname(a0,a1,n-1)^2/procname(a0,a1,n-2)) ; %p A048586 end if; %p A048586 end proc: %p A048586 A048586 := proc(n) %p A048586 L(6,8,n) ; %p A048586 end proc: # _R. J. Mathar_, Feb 12 2016 %t A048586 L[a0_, a1_, n_] := L[a0, a1, n] = Switch[n, 0, a0, 1, a1, _, Ceiling[L[a0, a1, n-1]^2/L[a0, a1, n-2]]]; %t A048586 a[n_] := L[6, 8, n]; %t A048586 Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Oct 25 2023, after _R. J. Mathar_ *) %o A048586 (PARI) pisotL(nmax, a1, a2) = { %o A048586 a=vector(nmax); a[1]=a1; a[2]=a2; %o A048586 for(n=3, nmax, a[n] = ceil(a[n-1]^2/a[n-2])); %o A048586 a %o A048586 } %o A048586 pisotL(50, 6, 8) \\ _Colin Barker_, Aug 07 2016 %Y A048586 Subsequence of A048583. See A008776 for definitions of Pisot sequences. %K A048586 nonn %O A048586 0,1 %A A048586 _David W. Wilson_