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.

A130074 Nonprimes k such that k divides 5^k - 3^k - 2^k = A130072(k).

This page as a plain text file.
%I A130074 #7 Feb 19 2021 04:22:19
%S A130074 1,4,6,8,9,12,15,16,18,24,25,27,32,36,44,45,48,54,64,72,75,81,95,96,
%T A130074 108,125,128,133,135,144,162,175,192,216,225,243,256,264,288,324,325,
%U A130074 361,375,384,405,432,475,486,512,561,576,594,618,625,648,675,704,729,768
%N A130074 Nonprimes k such that k divides 5^k - 3^k - 2^k = A130072(k).
%C A130074 Numbers k such that k divides A130072(k) are listed in A130073(n) = {1,2,3,4,5,6,7,8,9,11,12,13,15,16,17,18,19,23,24,25,27,29,31,32,36,37,41,43,...}, which includes all primes. a(n) includes nonprimes in A130073(n). p^(k+1) divides A130072(p^k) for prime p = {2,3,5,19} = A130076(n) and all k>0. It appears that a(n) includes all powers p^k of primes p = {2,3,5,19} for k>1 and all powers of numbers of the form 2^k*3^m, 3^k*5^m, 5^k*19^m.
%H A130074 Amiram Eldar, <a href="/A130074/b130074.txt">Table of n, a(n) for n = 1..10000</a>
%t A130074 Select[Range[10000],!PrimeQ[ # ]&&IntegerQ[(PowerMod[5,#,# ]-PowerMod[3,#,# ]-PowerMod[2,#,# ])/# ]&]
%Y A130074 Cf. A130072, A130073, A130075, A130076.
%K A130074 nonn
%O A130074 1,2
%A A130074 _Alexander Adamchuk_, May 06 2007