login
This site is supported by donations 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
1, 5, 13, 29, 61, 125, 253, 509, 1021, 1023, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1043, 1045, 1047, 1049, 1051, 1053, 1055, 1057, 1059, 1061, 1063, 1065, 1067, 1069, 1071, 1073, 1075, 1077, 1079, 1081, 1083, 1085, 1087, 1089, 1091, 1093 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

A cyclic sequence. The period is 6767.

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]

CROSSREFS

Cf. A029580.

Sequence in context: A093810 A093817 A120274 * A029580 A113914 A050415

Adjacent sequences:  A036979 A036980 A036981 * A036983 A036984 A036985

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 08 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:22 EST 2012. Contains 205706 sequences.