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!)
A182445 a(0)=0, a(1)=1, for n>1, a(n) = a(n-2) + (a(n-1) mod n). 3
0, 1, 1, 2, 3, 5, 8, 6, 14, 11, 15, 15, 18, 20, 24, 29, 37, 32, 51, 45, 56, 59, 71, 61, 84, 70, 102, 91, 109, 113, 132, 121, 157, 146, 167, 173, 196, 184, 228, 217, 245, 257, 250, 292, 278, 300, 302, 320, 334, 360, 344, 398, 378, 405, 405, 425, 438, 464, 438 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MATHEMATICA
Fold[Append[#1, Mod[#1[[-1]], #2] + #1[[-2]]] &, {0, 1}, Range[2, 58]] (* Ivan Neretin, Jun 18 2018 *)
PROG
(Python)
prpr = 0
prev = 1
for i in range(2, 99):
. current = prpr + (prev % i)
. print prpr,
. prpr = prev
. prev = current
CROSSREFS
Cf. A182444.
Sequence in context: A262263 A072987 A010075 * A010074 A355702 A116918
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 July 19 04:35 EDT 2024. Contains 374388 sequences. (Running on oeis4.)