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,4

Links

Antti Karttunen, Table of n, a(n) for n = 0..10080

Index entries for sequences related to factorial base representation

Formula

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

Prog

(Scheme, with memoizing definec-macro)
(definec (A257696 n) (cond ((zero? n) 0) (else (gcd (A060130 n) (A257696 (A257684 n))))))

Crossrefs

Cf. A060130, A257684, A257694, A257695.

Sequence in context: A328702 A165620 A128494 * A110730 A198339 A262561

Adjacent sequences: A257693 A257694 A257695 * A257697 A257698 A257699

Keyword

nonn

Author

Antti Karttunen, May 05 2015

Status

approved