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

1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 2, 6, 1, 2, 2, 3, 2, 6, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 6, 4, 2, 3, 3, 4, 6, 4, 1, 2, 2, 3, 2, 6, 2, 3, 3, 4, 6, 4, 2, 6, 6, 4, 3, 12, 2, 6, 6, 4, 3, 12, 1, 2, 2, 3, 2, 6, 2, 3, 3, 4, 6, 4, 2, 6, 6, 4, 3, 12, 2, 6, 6, 4, 6, 12, 1, 2, 2, 3, 2, 6, 2, 3, 3, 4, 6, 4, 2, 6, 6, 4, 3, 12, 2, 6, 6, 4, 6, 12, 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) = 1; for n >= 1, a(n) = lcm(A060130(n), a(A257684(n))).

Prog

(Scheme, with memoizing definec-macro)
(definec (A257695 n) (if (zero? n) 1 (lcm (A060130 n) (A257695 (A257684 n)))))

Crossrefs

Cf. A060130, A257684, A257694, A257696.

Sequence in context: A060130 A328482 A371091 * A257694 A281543 A287476

Adjacent sequences: A257692 A257693 A257694 * A257696 A257697 A257698

Keyword

nonn

Author

Antti Karttunen, May 05 2015

Status

approved