login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187825 Smallest k such that the partial sums of the divisors of k (in decreasing order) generate n primes. 2
1, 3, 2, 140, 560, 2160, 2772, 2016, 16830, 5148, 20592, 10640, 69300, 31200, 156240, 177840, 288288, 143520, 927360, 1203840, 752400, 1242360, 2702700, 2948400, 3996720, 1884960, 5896800, 2692800, 1244880, 15800400, 4586400, 11060280, 15301440, 14414400 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
It appears that a(n) is even for n > 0 and nonsquarefree for n > 2. The corresponding triangle of k in which row n gives the n primes starts:
k = 1 -> no prime
k = 3 -> 3;
k = 2 -> 2, 3;
k = 140 -> 293, 307, 317;
k = 560 -> 1373, 1451, 1481, 1487.
LINKS
EXAMPLE
a(3) = 140 because the partial sums of the divisors in decreasing order {140, 70, 35, 28, 20, 14, 10, 7, 5, 4, 2, 1} that generate 3 prime numbers are
140 + 70 + 35 + 28 + 20 = 293;
140 + 70 + 35 + 28 + 20 + 14 = 307;
140 + 70 + 35 + 28 + 20 + 14 + 10 = 317.
MAPLE
with(numtheory):for n from 0 to 40
do:ii:=0:for k from 1 to 4000000 while(ii=0) do:s:=0:x:=divisors(k):n1:=nops(x):it:=0:for a from n1 by -1 to 1 do:s:=s+x[a]:if type(s, prime)=true then it:=it+1:else fi:od: if it = n then ii:=1: printf ( "%d %d \n", n, k):else fi:od:od:
MATHEMATICA
a[n_] := Catch[ For[k = 1, True, k++, cnt = Count[ Accumulate[ Divisors[k] // Reverse], _?PrimeQ]; If[cnt == n, Print[{n, k}]; Throw[k]]]]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Dec 27 2012 *)
CROSSREFS
Sequence in context: A076932 A244083 A303683 * A297532 A369990 A037057
KEYWORD
nonn
AUTHOR
Michel Lagneau, Dec 27 2012
EXTENSIONS
a(19)-a(33) by Jean-François Alcover, Dec 28 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)