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.

A030088 a(n) = prime^2 and digits of prime do not appear in a(n).

This page as a plain text file.
%I A030088 #18 Jul 28 2025 08:06:51
%S A030088 4,9,49,289,841,2209,2809,3481,4489,6241,24649,29929,66049,94249,
%T A030088 97969,121801,124609,128881,167281,201601,218089,299209,310249,332929,
%U A030088 434281,452929,458329,546121,619369,727609,863041,2093809
%N A030088 a(n) = prime^2 and digits of prime do not appear in a(n).
%H A030088 Harvey P. Dale, <a href="/A030088/b030088.txt">Table of n, a(n) for n = 1..442</a> (All terms up to the 10 millionth prime.)
%F A030088 a(n) = A030086(n)^2. - _Robert Israel_, Nov 02 2022
%p A030088 R:= NULL: count:= 0: p:= 0:
%p A030088 while count < 40 do
%p A030088   p:= nextprime(p);
%p A030088   ps:= p^2;
%p A030088   if convert(convert(p,base,10),set) intersect convert(convert(ps,base,10),set) = {} then
%p A030088     R:= R, ps; count:= count+1
%p A030088   fi
%p A030088 od:
%p A030088 R; # _Robert Israel_, Nov 02 2022
%t A030088 Select[Prime[Range[250]],Intersection[IntegerDigits[#],IntegerDigits[#^2]]=={}&]^2 (* _Harvey P. Dale_, May 18 2024 *)
%Y A030088 Cf. A030086.
%Y A030088 Subsequence of A001248.
%K A030088 nonn,base
%O A030088 1,1
%A A030088 _Patrick De Geest_