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!)
A182444 a(0)=0, a(1)=1, for n>1, a(n) = a(n-1) + (a(n-2) mod n). 3
0, 1, 1, 2, 3, 5, 8, 13, 13, 17, 20, 26, 34, 34, 40, 44, 52, 62, 78, 83, 101, 121, 134, 140, 154, 169, 193, 200, 225, 251, 266, 269, 279, 284, 291, 295, 298, 334, 366, 388, 394, 413, 429, 455, 488, 493, 521, 544, 585, 590, 625, 654, 655, 673, 680, 693 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MATHEMATICA
nxt[{n_, a_, b_}]:={n+1, b, b+Mod[a, n+1]}; NestList[nxt, {1, 0, 1}, 60][[All, 2]] (* Harvey P. Dale, May 30 2020 *)
PROG
(Python)
prpr = 0
prev = 1
for i in range(2, 99):
. current = prev + (prpr % i)
. print prpr,
. prpr = prev
. prev = current
CROSSREFS
Cf. A182445.
Sequence in context: A237568 A272918 A010076 * A138183 A076591 A078695
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Apr 29 2012
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 June 7 08:50 EDT 2024. Contains 373161 sequences. (Running on oeis4.)