A353487 a(n) = A276086(2*n) mod 4, where A276086 is the primorial base exp-function.

1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3

Offset: 0

Author

Antti Karttunen, Apr 24 2022

Keywords

• nonn
• base

Links

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

Crossrefs

Even bisection of A353486. Odd bisection of A353516. Sequence A353517 shifted once left.

Cf. A010873, A276086, A353465, A353466, A353488, A353489, A353527.

Programs

PARI

A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A353487(n) = (A276086(2*n)%4);

Formula

a(n) = A353486(2*n) = A010873(A276086(2*n)).

a(n) = A353516(2*n + 1).

a(n) = A353517(1+n). [See comments in A353516 for a proof]

For n >= 1, a(n) = (A353517(n) * A353527(n)) mod 4.