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.

A259282 Quasi-Carmichael numbers to at least one negative base.

Original entry on oeis.org

35, 77, 143, 187, 209, 221, 247, 299, 323, 391, 437, 493, 527, 561, 589, 713, 899, 943, 989, 1073, 1105, 1147, 1189, 1247, 1271, 1295, 1333, 1517, 1537, 1591, 1595, 1705, 1729, 1739, 1763, 1829, 1927, 1961, 2021, 2093, 2257, 2279, 2419, 2465, 2479, 2501, 2623
Offset: 1

Views

Author

Tim Johannes Ohrtmann, Jun 23 2015

Keywords

Examples

			a(1) = 35 because this is the first squarefree composite number n such that at least one negative integer b exists such that for every prime factor p of n applies that p+b divides n+b (-3): 35=5*7 and 2, 4 both divide 32.
		

Crossrefs

Programs

  • PARI
    for(n=2, 1000000, if(!isprime(n), if(issquarefree(n), f=factor(n); b=-f[1, 1]; until(c==0 || b==-1, b++; c=0; for(i=1, #f[, 1], if((n+b)%(f[i, 1]+b)>0, c++)); if(c==0, print1(n, ", "))))))