[go: up one dir, main page]

login
Revision History for A374330 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
a(n) is the number of numbers k <= prime(n)^2 such that A075860(k) = prime(n).
(history; published version)
#8 by N. J. A. Sloane at Tue Jul 23 21:44:53 EDT 2024
STATUS

editing

approved

#7 by N. J. A. Sloane at Tue Jul 23 21:44:44 EDT 2024
NAME

a(n) is the number of numbers k <= prime(n)^2 and such that A075860(k) = prime(n).

EXAMPLE

For n=3, prime(3)=5. The only integers k <= 5^2 and such that A075860(k)=5 are 5,6,12,18,24 and 25. Therefore, a(3)=6.

STATUS

proposed

editing

Discussion
Tue Jul 23
21:44
N. J. A. Sloane: edited
#6 by Michel Marcus at Thu Jul 04 23:59:50 EDT 2024
STATUS

editing

proposed

Discussion
Fri Jul 05
03:40
Rafik Khalfi: Thanks Marcus 😊
#5 by Michel Marcus at Thu Jul 04 23:59:41 EDT 2024
NAME

a(n) is the number of numbers k <= prime(n)^2 and such that A075860(k) = prime(n).

DATA

2, 2, 6, 8, 2, 10, 3, 14, 6, 8, 22, 7, 8, 21, 9, 14, 12, 45, 14, 17, 45, 17, 21, 20, 18, 17, 64, 21, 54, 28, 25, 22, 22, 72, 37, 82, 26, 28, 31, 43, 36, 93, 44, 95, 38, 95, 41, 38, 33, 106, 36, 49, 111, 65, 53, 53, 49, 113, 55, 68, 138, 80, 49, 50, 152, 61, 55, 43, 73, 120, 55, 80, 63, 60, 65, 89, 81, 76, 84, 82

PROG

(PARI) fp(n, pn) = if (n == pn, n, fp(vecsum(factor(n)[, 1]), n));

f(n) = if (n==1, 0, fp(n, 0)); \\ A075860

a(n) = sum(k=1, prime(n)^2, f(k) == prime(n)); \\ Michel Marcus, Jul 04 2024

CROSSREFS
STATUS

proposed

editing

#4 by Rafik Khalfi at Thu Jul 04 20:59:00 EDT 2024
STATUS

editing

proposed

Discussion
Thu Jul 04
23:55
Michel Marcus: A075860 should go to xrefs
23:56
Michel Marcus: A001248 too
23:58
Michel Marcus: data is > 300 chars; could/should cut after term 120
#3 by Rafik Khalfi at Thu Jul 04 20:57:51 EDT 2024
COMMENTS

For all n>=1, a(n)n>=2.

#2 by Rafik Khalfi at Thu Jul 04 20:56:49 EDT 2024
NAME

allocated for Rafik Khalfia(n) is the number of numbers k <= prime(n)^2 and such that A075860(k)= prime(n).

DATA

2, 2, 6, 8, 2, 10, 3, 14, 6, 8, 22, 7, 8, 21, 9, 14, 12, 45, 14, 17, 45, 17, 21, 20, 18, 17, 64, 21, 54, 28, 25, 22, 22, 72, 37, 82, 26, 28, 31, 43, 36, 93, 44, 95, 38, 95, 41, 38, 33, 106, 36, 49, 111, 65, 53, 53, 49, 113, 55, 68, 138, 80, 49, 50, 152, 61, 55, 43, 73, 120, 55, 80, 63, 60, 65, 89, 81, 76, 84, 82

OFFSET

1,1

COMMENTS

For all n>=1, a(n)n>=2.

EXAMPLE

For n=3, prime(3)=5. The only integers k <= 5^2 and such that A075860(k)=5 are 5,6,12,18,24 and 25. Therefore, a(3)=6.

MAPLE

f := proc (n)

option remember;

if isprime(n) then

return n

else

return procname(convert(numtheory:-factorset(n), `+`))

end if

end proc:

g := proc (n)

local count, k;

count := 0;

for k from ithprime(n) to ithprime(n)^2 do

if f(k) = ithprime(n) then

count := count + 1

end if

end do;

return count

end proc:

map(g, [$1 .. 80]);

KEYWORD

allocated

nonn

AUTHOR

Rafik Khalfi, Jul 04 2024

STATUS

approved

editing

#1 by Rafik Khalfi at Thu Jul 04 20:56:49 EDT 2024
NAME

allocated for Rafik Khalfi

KEYWORD

allocated

STATUS

approved