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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020736 Pisot sequence L(5,8). 2

%I #16 Sep 08 2022 08:44:45

%S 5,8,13,22,38,66,115,201,352,617,1082,1898,3330,5843,10253,17992,

%T 31573,55406,97230,170626,299427,525457,922112,1618193,2839730,

%U 4983378,8745218,15346787,26931733,47261896,82938845,145547526,255418102,448227522,786584467

%N Pisot sequence L(5,8).

%H Colin Barker, <a href="/A020736/b020736.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) - a(n-4) (holds at least up to n = 1000 but is not known to hold in general).

%t RecurrenceTable[{a[0] == 5, a[1] == 8, a[n] == Ceiling[a[n - 1]^2/a[n - 2]]}, a, {n, 0, 40}] (* _Bruno Berselli_, Feb 05 2016 *)

%o (Magma) Lxy:=[5,8]; [n le 2 select Lxy[n] else Ceiling(Self(n-1)^2/Self(n-2)): n in [1..40]]; // _Bruno Berselli_, Feb 05 2016

%o (PARI) pisotL(nmax, a1, a2) = {

%o a=vector(nmax); a[1]=a1; a[2]=a2;

%o for(n=3, nmax, a[n] = ceil(a[n-1]^2/a[n-2]));

%o a

%o }

%o pisotL(50, 5, 8) \\ _Colin Barker_, Aug 07 2016

%Y See A008776 for definitions of Pisot sequences.

%K nonn

%O 0,1

%A _David W. Wilson_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)