Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)

Revision History for A181487

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A181487 Numbers k such that Sum_{d|k, d<k, d not occurring before} d > k.
(history; published version)
#13 by Alois P. Heinz at Sat Jan 06 19:00:50 EST 2024
STATUS

proposed

approved

#12 by Andrew Howroyd at Sat Jan 06 18:21:27 EST 2024
STATUS

editing

proposed

#11 by Andrew Howroyd at Sat Jan 06 15:49:31 EST 2024
LINKS

WikiepdiaWikipedia, <a href="https://en.wikipedia.org/wiki/Granville_number">Granville number</a>.

STATUS

approved

editing

#10 by N. J. A. Sloane at Sat Aug 12 00:48:10 EDT 2023
STATUS

proposed

approved

#9 by Amiram Eldar at Fri Aug 11 03:17:11 EDT 2023
STATUS

editing

proposed

#8 by Amiram Eldar at Fri Aug 11 02:44:31 EDT 2023
COMMENTS

Sometimes called S-abundant numbers, since they are analogous to abundant numbers (A005101) as S-perfect numbers (118372A118372) are analogous to perfect numbers (A000396).

#7 by Amiram Eldar at Fri Aug 11 02:44:20 EDT 2023
CROSSREFS

Cf. A000396, A005101, 118372A118372.

#6 by Amiram Eldar at Fri Aug 11 02:43:11 EDT 2023
NAME

Numbers k such that n < sum( d : Sum_{d|nk, d<nk, d not occurring before ).} d > k.

COMMENTS

From Amiram Eldar, Aug 11 2023: (Start)

Sometimes called S-abundant numbers, since they are analogous to abundant numbers (A005101) as S-perfect numbers (118372) are analogous to perfect numbers (A000396).

De Koninck and Ivić conjectured that this sequence has an asymptotic density.

The numbers of terms not exceeding 10^k, for k = 2, 3, ..., are 15, 152, 1567, 15336, 154301, 1541445, 15392073, ... . Apparently, the asymptotic density of this sequence exists and equals 0.15... . (End)

REFERENCES

Elena Deza, Perfect and Amicable Numbers, World Scientific, 2023, pp. 325-327.

LINKS

Jean-Marie De Koninck and Aleksandar Ivić, <a href="https://www.emis.de/journals/PIMB/078/2.html">On a sum of divisors problem</a>, Publications de l'Institut Mathématique (Beograd), New Series, Vol. 64 (78) (1998), pp. 9-20.

Gérard Villemin, <a href="http://villemin.gerard.free.fr/aNombre/TYPDIVIS/ParfaitS.htm">Nombres S-PARFAITS ou Nombres de Granville</a>, NOMBRES - Curiosités, théorie et usages, 2019 (in French).

Wikiepdia, <a href="https://en.wikipedia.org/wiki/Granville_number">Granville number</a>.

MATHEMATICA

seq[kmax_] := Module[{s = {1}, a = {}, sum}, Do[sum = Total[Select[Divisors[k], MemberQ[s, #] &]]; If[sum <= k, AppendTo[s, k], AppendTo[a, k]], {k, 2, kmax}]; a]; seq[400] (* Amiram Eldar, Aug 11 2023 *)

CROSSREFS

Cf. A000396, A005101, 118372.

STATUS

approved

editing

#5 by Joerg Arndt at Sat Sep 14 03:22:22 EDT 2013
STATUS

proposed

approved

#4 by Donovan Johnson at Sat Sep 14 03:10:41 EDT 2013
STATUS

editing

proposed

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 August 22 00:18 EDT 2024. Contains 375353 sequences. (Running on oeis4.)