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.

A342349 a(n) = p^3 where p is prime and digits of p counted with multiplicity appear in a(n).

This page as a plain text file.
%I A342349 #6 Mar 18 2021 05:44:59
%S A342349 125,1331,24389,205379,226981,300763,357911,389017,912673,1030301,
%T A342349 1295029,2571353,12649337,15813251,22188041,38272753,41781923,
%U A342349 58863869,64481201,101847563,124251499,158340421,237176659,263374721,318611987,344472101,371694959,393832837
%N A342349 a(n) = p^3 where p is prime and digits of p counted with multiplicity appear in a(n).
%C A342349 Subsequence of A030082. Coincides with A030082(n) for 1 <= n <= 12.
%e A342349 a(13) = 12649337 = 233^3. 233 is prime and 12649337 contains one digit '2' and two digits '3'.
%o A342349 (Python)
%o A342349 from multiset import Multiset
%o A342349 from sympy import prime
%o A342349 A342349_list = []
%o A342349 for i in range(1,10**6):
%o A342349     p = prime(i)
%o A342349     q = p**3
%o A342349     if Multiset(str(p)) <= Multiset(str(q)):
%o A342349         A342349_list.append(q)
%Y A342349 Cf. A030082.
%K A342349 nonn,base
%O A342349 1,1
%A A342349 _Chai Wah Wu_, Mar 17 2021