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!)
A267476 Primes p such that 2*p + 1 is abundant. 1
787, 2677, 2887, 3217, 3307, 4567, 5197, 5827, 7507, 7717, 9817, 10867, 11497, 12757, 12967, 14107, 14437, 15277, 15907, 16087, 16747, 17077, 18427, 19687, 20947, 21157, 23017, 23677, 23887, 24097, 25357, 28297, 29137, 29347, 31237, 31657, 32077, 32917, 33547, 33637, 34807, 35227, 35437, 37537, 39217 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All terms, usually ending with 7, give rise to odd abundant numbers (A005231). The first five terms that do not end with 7 are 111919, 121621, 391891, 480343, and 724531. Most terms are equal 1 mod 6, including all among the first 10^8 primes. Exceptions to this rule, as pointed out by Robert Israel, do exist.
A term not congruent to 1 mod 6 is 49079172691436387. - Robert Israel, Jan 18 2016
LINKS
EXAMPLE
For n = 1, 2 * 787 + 1 = 1575, which is the second odd abundant number (see A005231).
MAPLE
select(p -> isprime(p) and numtheory:-sigma(2*p+1) > 2*(2*p+1), [seq(i, i=3..50000, 2)]); # Robert Israel, Jan 18 2016
MATHEMATICA
Select[Prime[Range[10000]], (DivisorSigma[1, 2 * # + 1] > 2(2 * # + 1)) &]
PROG
(PARI) isok(n) = isprime(n) && (sigma(2*n+1) > 4*n+2); \\ Michel Marcus, Jan 15 2016
CROSSREFS
Cf. A000040 (prime numbers), A005231 (odd abundant numbers).
Sequence in context: A097774 A031896 A045231 * A068660 A097775 A321210
KEYWORD
nonn
AUTHOR
Waldemar Puszkarz, Jan 15 2016
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 April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)