A263101 a(n) = F(F(n)) mod F(n), where F = Fibonacci = A000045.

0, 0, 1, 2, 0, 5, 12, 5, 33, 5, 1, 0, 232, 233, 55, 5, 1596, 2563, 1, 5, 987, 10946, 28656, 0, 0, 75025, 189653, 89, 1, 6765, 1, 5, 6765, 1, 9227460, 0, 24157816, 1, 63245985, 5, 1, 267914275, 433494436, 4181, 1134896405, 1, 2971215072, 0, 7778741816, 75025

Offset

1,4

Links

Alois P. Heinz, Table of n, a(n) for n = 1..2000

Formula

a(n) = A007570(n) mod A000045(n).

Maple

F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
p:= (M, n, k)-> map(x-> x mod k, `if`(n=0, <<1|0>, <0|1>>,
          `if`(n::even, p(M, n/2, k)^2, p(M, n-1, k).M))):
a:= n-> p(<<0|1>, <1|1>>, F(n)$2)[1, 2]:
seq(a(n), n=1..50);

Crossrefs

Cf. A000045, A002708, A007570, A076240, A127787 (where a(n)=0), A263112, A274996.

Sequence in context: A292590 A080901 A137260 * A219765 A153059 A151336

Adjacent sequences: A263098 A263099 A263100 * A263102 A263103 A263104

Keyword

nonn

Author

Alois P. Heinz, Oct 09 2015

Status

approved