login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A071631
Number of terms in the set InvPhi(16*prime(n)), where prime(n) is the n-th prime.
4
7, 11, 10, 6, 8, 4, 5, 0, 5, 8, 0, 6, 5, 4, 0, 5, 0, 2, 4, 3, 4, 4, 5, 5, 6, 3, 0, 3, 0, 5, 4, 8, 3, 4, 3, 2, 0, 6, 0, 5, 8, 2, 5, 6, 0, 4, 0, 0, 0, 0, 5, 8, 0, 5, 0, 0, 3, 2, 4, 5, 0, 5, 4, 0, 2, 0, 2, 2, 3, 0, 0, 5, 0, 4, 0, 0, 0, 2, 3, 4, 5, 2, 8, 4, 0, 5, 3, 0, 0, 0, 0, 3, 6, 8, 4, 0, 8, 0, 2, 0, 2, 3, 0, 0
OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Donovan Johnson)
EXAMPLE
invphi(16*29) = {699,885,932,944,1180,1398,1416,1770} so a(10) = 8.
MAPLE
[seq(nops(invphi(16*ithprime(i))), i=1..128)];
PROG
(PARI) a(n) = invphiNum(16*prime(n)); \\ Amiram Eldar, Nov 07 2024, using Max Alekseyev's invphi.gp
KEYWORD
nonn
AUTHOR
Labos Elemer, May 30 2002
STATUS
approved