A365461 -id:A365461 - cp's OEIS frontend

A365460 Number of distinct primorials in the greedy sum of primorials adding to A181821(n).

1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 4, 1, 2, 2, 3, 1, 2, 2, 2, 2, 3, 2, 4, 1, 3, 3, 2, 1, 5, 3, 3, 1, 3, 2, 3, 2, 2, 3, 5, 1, 3, 2, 3, 2, 5, 2, 2, 1, 3, 4, 5, 2, 5, 4, 3, 1, 3, 2, 6, 2, 4, 2, 6, 1, 6, 4, 3, 3, 4, 3, 6, 1, 3, 3, 7, 2, 4, 4, 4, 2, 8, 2, 4, 3, 4, 4, 4, 1, 6, 3, 3, 2, 6, 3, 7, 2, 3

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

Antti Karttunen, Sep 15 2023

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from indices in prime factorization
Index entries for sequences related to primorial base

Cf. A122111, A181821, A267263, A329040.

Cf. also A365461.

A181821(n) = { my(f=factor(n),p=0,m=1); forstep(i=#f~,1,-1,while(f[i,2], f[i,2]--; m *= (p=nextprime(p+1))^primepi(f[i,1]))); (m); };
A267263(n) = { my(s=0, p=2, d); while(n, d = (n%p); s += !!d; n = (n-d)/p; p = nextprime(1+p)); (s); };
A365460(n) = A267263(A181821(n));

a(n) = A267263(A181821(n)).
a(n) = A329040(A122111(n)).
a(n) <= A365461(n).

cp's OEIS Frontend

A365460 Number of distinct primorials in the greedy sum of primorials adding to A181821(n).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula