cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 03 2016

Keywords

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)

Examples

			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.
		

Crossrefs

Programs

Extensions

a(42) and a(60) corrected by Jon E. Schoenfield, Dec 03 2016
Definition edited by N. J. A. Sloane, Jun 19 2020