A072987 -id:A072987 - cp's OEIS frontend

A262263 Duplicate of A072987.

1, 1, 1, 2, 3, 5, 8, 6, 7, 13, 10, 13, 11, 12, 23, 20, 12, 16, 28, 25, 14, 19, 33, 29, 15, 20, 35, 28, 8, 8, 16, 24, 40, 31, 38, 34, 37, 34, 34, 68, 62, 49, 28, 35, 63, 53, 25, 32, 57, 40, 48, 88, 84, 67, 44, 57, 45, 46, 91, 78, 50, 68, 56, 62

Offset: 1

dead

Duplicate of A072987.

A096534 a(1) = 0; a(2) = 1; a(n) = (a(n-1) + a(n-2)) mod n.

Original entry on oeis.org

0, 1, 1, 2, 3, 5, 1, 6, 7, 3, 10, 1, 11, 12, 8, 4, 12, 16, 9, 5, 14, 19, 10, 5, 15, 20, 8, 0, 8, 8, 16, 24, 7, 31, 3, 34, 0, 34, 34, 28, 21, 7, 28, 35, 18, 7, 25, 32, 8, 40, 48, 36, 31, 13, 44, 1, 45, 46, 32, 18, 50, 6, 56, 62, 53, 49, 35, 16, 51, 67, 47, 42, 16, 58, 74, 56, 53, 31, 5, 36

Offset: 1

Franklin T. Adams-Watters, Jun 23 2004

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A079777, A096535.

A072987 is a closely related sequence.

N:= 100: # to get a(1)..a(N)
A:= Vector(N):
A[1]:= 0: A[2]:= 1:
for n from 3 to N do
  A[n]:= A[n-1] + A[n-2] mod n
od:
convert(A,list); # Robert Israel, Nov 13 2017

l = {0, 1}; For[i = 3, i <= 100, i++, len = Length[l]; l = Append[l, Mod[l[[len]] + l[[len - 1]], i]]]; l

cp's OEIS Frontend

A262263 Duplicate of A072987.

Views

Author

Keywords

Crossrefs

A096534 a(1) = 0; a(2) = 1; a(n) = (a(n-1) + a(n-2)) mod n.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica