|
|
A162302
|
|
Numbers n such that (A000203(n)+28)/n is an integer.
|
|
0
|
|
|
1, 28, 29, 62, 84, 182, 230, 252, 344, 756, 944, 2268, 6710, 6804, 20264, 20412, 36224, 61236, 183708, 538112, 551124, 1653372, 2085710, 4960116, 14503550, 14880348, 33665024, 44641044, 55328384, 133923132, 134438912, 401769396, 615206030, 1082574464
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Contains the subset of all n of the form 28*3^k.
Generalized sequences are defined by A*A000203(n)+ B = C*n with A,B,C integers.
Then we get for different settings of A, B, C hyperperfect numbers:
Not in the OEIS: A=1, C=3, B=12,18,28,... A=2, C=3, B=21,27,33,45,... A=3, C=4, B=20,...
Terms not of the form 28*3^n: 1, 29, 62, 182, 230, 344, 944, 6710, 20264, 36224, 538112, 2085710, 14503550, 33665024, 55328384, ..., . [Robert G. Wilson v, Sep 05 2010]
|
|
LINKS
|
|
|
MAPLE
|
A000203 := proc(n) numtheory[sigma](n) ; end proc:
isA152302 := proc(n) (A000203(n)+28) mod n = 0 ; end proc:
for n from 1 to 1000000 do if isA152302(n) then printf("%d, ", n) ; end if ; end do: # R. J. Mathar, Aug 25 2010
|
|
MATHEMATICA
|
fQ[n_] := Divisible[ DivisorSigma[1, n] + 28, n]; lst = {}; k = 1; While[k < 10^9/4, If[ fQ@k, AppendTo[lst, k]; Print@k]; k++ ]; lst (* Robert G. Wilson v, Sep 05 2010 *)
|
|
CROSSREFS
|
Cf. A000203, A000396, A000079, A005820, A056006, A125246, A141548, A125247, A101223, A141549, A141550, A125248,
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Missing terms (1, 29, 182,..) inserted, 7 terms added, comment corrected - R. J. Mathar, Aug 25 2010
|
|
STATUS
|
approved
|
|
|
|