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!)
A144839 a(n) = Lucas(7^n). 4
29, 17393796001, 481682208844384447843365760878364816732549453120338354329505085763436029 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Previous name was: a(n) = round(phi^(7^n)) where phi = 1.6180339887498948482... = (sqrt(5)+1)/2.
LINKS
FORMULA
a(n) = G^(7^n) + (1 - G)^(7^n) = G^(7^n) + (-G)^(-7^n) where G is the golden ratio A001622. [Artur Jasinski, Oct 05 2008]
From Peter Bala, Nov 28 2022: (Start)
a(n) = Lucas(7^n).
a(n+1) = a(n)^7 + 7*a(n)^5 + 14*a(n)^3 + 7*a(n) with a(0) = 1.
a(n) == 1 (mod 7).
a(n+1) == a(n) (mod 7^(n+1)) for n >= 1 (a particular case of the Gauss congruences for the Lucas numbers).
In the ring of 7-adic integers, the limit_{n -> oo} a(n) exists and is a root of the quartic equation x^4 + 4*x^2 + 2 = 0. (End)
MAPLE
a := proc(n) option remember; if n = 0 then 1 else a(n-1)^7 + 7*a(n-1)^5 + 14*a(n-1)^3 +7*a(n-1) end if; end;
seq(a(n), n = 1..5); # Peter Bala, Nov 28 2022
MATHEMATICA
c = N[GoldenRatio, 1000]; Table[Round[c^(7^n)], {n, 1, 5}]
c = (1 + Sqrt[5])/2; Table[Expand[c^(7^n) + (1 - c)^(7^n)], {n, 0, 5}] (* Artur Jasinski, Oct 05 2008 *)
CROSSREFS
Sequence in context: A087528 A307622 A219015 * A124992 A296522 A023926
KEYWORD
nonn,bref
AUTHOR
Artur Jasinski, Sep 22 2008
EXTENSIONS
New name from Peter Bala, Nov 28 2022
STATUS
approved

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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)