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!)
A036982 a(n)=[ a*a(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ a*a(n-1)+b ]. 1

%I #8 Apr 19 2016 01:07:31

%S 1,5,13,29,61,125,253,509,1021,1023,1025,1027,1029,1031,1033,1035,

%T 1037,1039,1041,1043,1045,1047,1049,1051,1053,1055,1057,1059,1061,

%U 1063,1065,1067,1069,1071,1073,1075,1077,1079,1081,1083,1085,1087,1089,1091,1093

%N a(n)=[ a*a(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ a*a(n-1)+b ].

%C A cyclic sequence. The period is 6767.

%C If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the nw to se diagonals can be extended by computation. The above minus the first digit is diagonal 4. See A159741 for details. [From Al Hakanson (hawkuu(AT)gmail.com), Apr 20 2009]

%Y Cf. A029580.

%K nonn

%O 0,2

%A _Yasutoshi Kohmoto_

%E More terms from _James A. Sellers_, Aug 08 2000

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 5 14:41 EDT 2024. Contains 372275 sequences. (Running on oeis4.)