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.

A328386 a(n) = A276086(n) mod n.

This page as a plain text file.
%I A328386 #10 Oct 16 2019 13:18:40
%S A328386 0,1,0,1,3,5,3,7,3,5,2,1,11,5,0,1,8,17,3,15,15,3,19,1,0,3,24,25,27,7,
%T A328386 14,21,9,29,21,35,33,29,15,35,15,7,6,41,15,11,1,11,35,25,48,23,9,1,5,
%U A328386 21,30,51,44,49,37,23,42,57,37,47,21,55,21,35,8,1,41,49,0,5,28,41,5,55,57,21,26,49,50,27,6,9,73,73,49
%N A328386 a(n) = A276086(n) mod n.
%H A328386 Antti Karttunen, <a href="/A328386/b328386.txt">Table of n, a(n) for n = 1..30030</a>
%F A328386 a(n) = A276086(n) mod n.
%t A328386 Block[{b = MixedRadix[Reverse@ Prime@ Range@ 12]}, Array[Mod[Apply[Times, Power @@@ # &@ Transpose@ {Prime@ Range@ Length@ #, Reverse@ #}] &@ IntegerDigits[#, b], #] &, 91]] (* _Michael De Vlieger_, Oct 15 2019 *)
%o A328386 (PARI)
%o A328386 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328386 A328386(n) = (A276086(n)%n);
%Y A328386 Cf. A276086, A324198, A328382, A328387 (positions of zeros).
%K A328386 nonn
%O A328386 1,5
%A A328386 _Antti Karttunen_, Oct 15 2019