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!)
A277110 a(n) = A066048(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1. 1

%I #38 Feb 10 2017 20:12:39

%S 0,1,1,4,25,841,866,1707,2573,214,2787,9006001,6898,1099,7997,758,515,

%T 1273,298,2468041,2468339,5674,2474013,13853,2487866,5357,2493223,

%U 1322,498909,250231053361,7149472922,203937,420569227,1581854,9201,1591055,94,13371,13465,13418,309,371,34,15,49,4,2809

%N a(n) = A066048(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1.

%C The sequence enters a cycle after 1440 terms.

%C 7833343487493084437^2 is the largest term of this sequence.

%H Altug Alkan, <a href="/A277110/b277110.txt">Table of n, a(n) for n = 0..2000</a>

%F a(n) = a(n+480) for n > 1440.

%e a(4) = 25 because A066048(1 + 4) = A066048(5) = 25.

%Y Cf. A000045, A066048, A175723.

%K nonn

%O 0,4

%A _Altug Alkan_, Feb 09 2017

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 24 19:59 EDT 2024. Contains 371963 sequences. (Running on oeis4.)