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!)
A279024 Number of extradivisors of n (m < n is an extradivisor of n if for some positive k < n, m | n | k^(n+1) + m and n | (n-k)^(n+1) + m). 3
0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 2, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,45
COMMENTS
All extradivisors of n are odd numbers.
Extradivisor primes (even prime 2 and Pythagorean primes (A002144) base extradivisor 1): 2, 5, 13, 17, 29, 37, 53, 61, 137, 181, 229, 233, 257, 281, 353, 373, 421, 433, 449, 457, 557, 641, 653, 709, 733, 773, 809, 877, 941, 1021, ...
Extradivisor semiprimes: 6, 10, 14, 15, 21, 22, 25, 26, 33, 34, 38, 46, 51, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, ...
From Michael De Vlieger, Dec 07 2016: (Start)
Smallest number with n extradivisors: {1, 2, 45, 105, 1365, 1305, ...}.
a(n) = 0 for n = 0 (mod 4) in observed cases with n <= 3000. (End)
LINKS
EXAMPLE
1 is an extradivisor of 2 because 2 divides 1^(2+1) + 1 and (2-1)^(2+1) + 1; 2 divides 2 and 2.
1 is an extradivisor of 5 because 5 divides 2^(5+1) + 1 and (5-2)^(5+1) + 1; 5 divides 65 and 730.
3 is an extradivisor of 6 because 6 divides 3^(6+1) + 3 and (6-3)^(6+1) + 3; 6 divides 2190 and 2190.
MATHEMATICA
Table[Length@ Select[DeleteCases[Most@ Divisors@ n, d_ /; EvenQ@ d], Function[m, AnyTrue[Range[n - 1], Function[k, And[Divisible[k^(n + 1) + m, n], Divisible[(n - k)^(n + 1) + m, n]]]]]], {n, 90}] (* Version 10, eliminate "Length@" to list extradivisors, or *)
Table[Count[Select[Most@ Divisors@ n, OddQ], _?(Total@ Boole@ Map[Function[k, And[Mod[k^(n + 1) + #, n] == 0, Mod[(n - k)^(n + 1) + #, n] == 0]], Range[1, n - 1, 2]] > 0 &)], {n, 3*10^3}] (* Michael De Vlieger, Dec 07 2016, more efficient Jun 17 2020 *)
CROSSREFS
Sequence in context: A015114 A016219 A298246 * A213731 A299197 A334196
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(42) and a(60) corrected by Jon E. Schoenfield, Dec 03 2016
Definition edited by N. J. A. Sloane, Jun 19 2020
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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)