A257696 a(0) = 0; for n >= 1, a(n) = gcd(A060130(n), a(A257684(n))).

0, 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 1, 1, 2, 3, 3, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 0

Author

Antti Karttunen, May 05 2015

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10080
• Index entries for sequences related to factorial base representation

Crossrefs

Cf. A060130, A257684, A257694, A257695.

Formula

a(0) = 0; for n >= 1, a(n) = gcd(A060130(n), a(A257684(n))).