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.

A225508 -4-Knödel numbers.

This page as a plain text file.
%I A225508 #18 Feb 16 2025 08:33:19
%S A225508 4,6,8,12,14,16,20,24,40,48,56,60,66,80,104,120,140,176,204,240,260,
%T A225508 266,476,560,696,728,920,1020,1040,1292,1508,1634,1736,1820,1976,2320,
%U A225508 2544,2660,3416,3440,3848,4136,4686,4756,5180,5456,6188,6608,7280,8004,8816
%N A225508 -4-Knödel numbers.
%C A225508 Extension of k-Knödel numbers to k negative, in this case equal to -4. Composite numbers n > 0 such that if 1 < a < n and gcd(n,a) = 1 then a^(n+4) = 1 mod n.
%C A225508 All terms are even numbers.
%H A225508 Amiram Eldar, <a href="/A225508/b225508.txt">Table of n, a(n) for n = 1..1000</a>
%H A225508 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnoedelNumbers.html">Knödel Numbers</a>
%p A225508 with(numtheory); ListA225508:=proc(q,k) local a,n,ok;
%p A225508 for n from 2 to q do if not isprime(n) then ok:=1; for a from 1 to n do
%p A225508 if gcd(a,n)=1 then if (a^(n-k)-1) mod n<>0 then ok:=0; break; fi; fi;
%p A225508 od; if ok=1 then print(n); fi; fi; od; end: ListA225508(10^6,-4);
%t A225508 Select[Range[10000], CompositeQ[#] && Divisible[# + 4, CarmichaelLambda[#]] &] (* _Amiram Eldar_, Mar 28 2019 *)
%Y A225508 Cf. A208728.
%Y A225508 Cf. A225506, A225507, A225509, A225510, A225511, A225512, A225513, A225514.
%K A225508 nonn
%O A225508 1,1
%A A225508 _Paolo P. Lava_, May 09 2013
%E A225508 More terms from _Amiram Eldar_, Mar 28 2019