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.

A328634 Numbers n for which A328578(n) = A257993(A276086(A276086(n))) = 4.

This page as a plain text file.
%I A328634 #7 Oct 27 2019 17:32:21
%S A328634 4,8,16,32,64,152,184,210,242,274,362,394,440,448,452,484,572,604,634,
%T A328634 638,646,662,694,782,814,872,904,992,1024,1070,1078,1082,1114,1202,
%U A328634 1234,1264,1268,1276,1292,1324,1412,1444,1470,1502,1534,1622,1654,1700,1708,1712,1744,1832,1864,1894,1898,1906,1922,1954,2042
%N A328634 Numbers n for which A328578(n) = A257993(A276086(A276086(n))) = 4.
%C A328634 Numbers n for which A276087(n) is a multiple of 30, but not of 7.
%H A328634 Antti Karttunen, <a href="/A328634/b328634.txt">Table of n, a(n) for n = 1..10000</a>
%H A328634 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A328634 (PARI)
%o A328634 A257993(n) = { for(i=1,oo,if(n%prime(i),return(i))); }
%o A328634 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328634 A328578(n) = A257993(A276086(A276086(n)));
%o A328634 isA328634(n) = (4==A328578(n));
%Y A328634 Row 4 of A328631.
%Y A328634 Cf. A257993, A276086, A328578.
%K A328634 nonn
%O A328634 1,1
%A A328634 _Antti Karttunen_, Oct 27 2019