login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A129494
Composite numbers k such that 4^k mod k is a power of 4 greater than 1.
6
6, 12, 15, 20, 22, 24, 26, 28, 30, 34, 38, 40, 46, 48, 56, 58, 60, 62, 66, 69, 72, 74, 77, 80, 82, 84, 85, 86, 87, 88, 91, 93, 94, 96, 102, 104, 105, 106, 111, 117, 118, 120, 122, 123, 126, 129, 132, 134, 140, 141, 142, 144, 146, 158, 159, 166, 168, 170, 177, 178, 182
OFFSET
1,1
COMMENTS
Complement to composite numbers: 4, 8, 9, 10, 14, 16, 18, 21, 25, 27, 32, 33, 35, 36, 39, 42, 44, 45, 49, 50, 51, 52, 54, 55, 57, ... - R. J. Mathar, May 16 2008
LINKS
EXAMPLE
22 is a term since 4^22 mod 22 = 16.
MAPLE
filter:= proc(n) local k, j;
if isprime(n) then return false fi;
k:= 4 &^ n mod n;
j:= padic:-ordp(k, 2);
k>1 and j::even and k = 2^j
end proc:
select(filter, [$4..1000]); # Robert Israel, Dec 03 2019
MATHEMATICA
Select[ Range@ 161, IntegerQ@ Log[4, PowerMod[4, #, # ]] &]
PROG
(Magma) [k:k in [2..200]| not IsPrime(k) and not IsZero(a) and (PrimeDivisors(a) eq [2]) and &+[j[1]*j[2]: j in Factorization(a) ] mod 4 eq 0 where a is 4^k mod k]; // Marius A. Burtea, Dec 04 2019
CROSSREFS
Contains A122781 except for 1 and 4.
Sequence in context: A315617 A287572 A315618 * A001284 A320142 A063931
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Apr 17 2007
EXTENSIONS
Corrected and extended by R. J. Mathar, May 16 2008
STATUS
approved