A286368 a(n) = 4*A072401(n) + 2*A229062(n) + A010052(n).

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

Offset: 1

Author

Antti Karttunen, May 08 2017

Keywords

• nonn

Comments

Partitions natural numbers to the same equivalence classes as A002828. That is, for all i, j: a(i) = a(j) <=> A002828(i) = A002828(j). To get A002828 replace 0's with 3's, 3's with 1's and keep 2's as 2's and 4's as 4's.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A002828, A010052, A072401, A229062, A286366.

Programs

Scheme

(define (A286368 n) (+ (* 4 (A072401 n)) (* 2 (A229062 n)) (A010052 n)))

Formula

a(n) = 4*A072401(n) + 2*A229062(n) + A010052(n).