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

1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 4, 6, 1, 2, 2, 3, 4, 6, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 6, 8, 2, 3, 3, 4, 6, 8, 1, 2, 2, 3, 4, 6, 2, 3, 3, 4, 6, 8, 4, 6, 6, 8, 9, 12, 4, 6, 6, 8, 9, 12, 1, 2, 2, 3, 4, 6, 2, 3, 3, 4, 6, 8, 4, 6, 6, 8, 9, 12, 8, 12, 12, 16, 18, 24, 1, 2, 2, 3, 4, 6, 2, 3, 3, 4, 6, 8, 4, 6, 6, 8, 9, 12, 8, 12, 12, 16, 18, 24, 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) = A060130(n) * a(A257684(n)).

Other identities:

For all n >= 1, a(A033312(n)) = A000142(n-1).

Prog

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

Crossrefs

Cf. A034968, A060130, A257684, A257695, A257696, A227153.

Sequence in context: A328482 A371091 A257695 * A281543 A287476 A185317

Adjacent sequences: A257691 A257692 A257693 * A257695 A257696 A257697

Keyword

nonn

Author

Antti Karttunen, May 05 2015

Status

approved