The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A053523 a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.9, p=2. 2

%I #5 Apr 19 2016 01:07:32

%S 1,1,3,5,9,15,25,41,67,109,177,287,465,753,305,265,571,837,705,193,

%T 899,547,181,729,911,821,867,845,857,213,67,281,349,631,981,807,895,

%U 213,555,769,663,717,691,705,699,703,351,33,385,419,805,613

%N a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.9, p=2.

%C Becomes a cyclic sequence whose period is 269.

%Y A053521, A053522.

%K nonn

%O 1,3

%A _Yasutoshi Kohmoto_

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 May 13 19:11 EDT 2024. Contains 372522 sequences. (Running on oeis4.)