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.

A295900 Numbers n such that n^3 contains the consecutive substring 2,3,5,7.

This page as a plain text file.
%I A295900 #19 Mar 10 2024 00:23:51
%S A295900 1331,3108,3176,4093,4643,5846,6178,6797,9175,10731,13076,13245,13309,
%T A295900 13310,14093,14526,16291,17852,20095,20791,21835,23635,23766,24093,
%U A295900 28452,28672,28673,28674,28675,29211,31080,31760,33907,34093,34986,36449,38538,38599,39526
%N A295900 Numbers n such that n^3 contains the consecutive substring 2,3,5,7.
%H A295900 Chai Wah Wu, <a href="/A295900/b295900.txt">Table of n, a(n) for n = 1..10000</a>
%e A295900 1331 is in the sequence because 1331^3 = 2357947691 contains substring of prime digits "2357".
%e A295900 3108 is in the sequence because 3108^3 = 30022235712 contains substring of prime digits "2357".
%t A295900 Select[Range[100000], MemberQ[Partition[IntegerDigits[#^3], 4, 1], {2, 3, 5, 7}] &]
%o A295900 (PARI) isok(n) = {c = n^3; ret = 0; while (c > 1, if ((c % 10000) == 2357, ret = 1; break); c = floor(c/10);); return (ret);} \\ _Michel Marcus_, Dec 15 2017
%o A295900 (Python) A295900_list = [n for n in range(1,10**6) if '2357' in str(n**3)] # _Chai Wah Wu_, Feb 09 2018
%Y A295900 Cf. A018834, A029942, A085823.
%K A295900 nonn,base
%O A295900 1,1
%A A295900 _K. D. Bajpai_, Nov 29 2017