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.
%I A163648 #22 May 27 2024 22:38:01
%S A163648 7,11,13,17,19,23,29,31,41,43,53,59,61,83,89,107,113,127,137,157,167,
%T A163648 173,179,197,227,257,271,307,313,337,347,367,373,379,397,419,457,467,
%U A163648 479,487,547,557,571,587,607,613,619,647,673,701,709,733,739,743,751
%N A163648 Primes p with a prime number of syllables in their name in American English.
%C A163648 The word "and" is excluded, 101 is "one hundred one" rather than "one hundred and one."
%C A163648 See A231073 and A231075 for the analogs counting words resp. letters. - _M. F. Hasler_, Nov 03 2013
%H A163648 <a href="/index/El#English">Index to OEIS: sequences related to English words for n</a>
%F A163648 {p in A000040 such that A075774(p) is in A000040}.
%e A163648 a(1) = 7, which has a prime number, 2, of syllables sev-en. a(2) = 11, which has a prime number, 3, of syllables e-lev-en.
%o A163648 (PARI) forprime(p=1,900,isprime(A075774(p))&&print1(p",")) \\ - _M. F. Hasler_, Nov 03 2013
%o A163648 (PARI) is(p)=isprime(A075774(p))&&isprime(p) \\ - _M. F. Hasler_, Nov 03 2013
%o A163648 (Python) # uses function in A075774
%o A163648 from sympy import isprime
%o A163648 def ok(n): return isprime(A075774(n)) and isprime(n)
%o A163648 print([k for k in range(800) if ok(k)]) # _Michael S. Branicky_, May 27 2024
%Y A163648 Cf. A000040, A075774, A164043.
%K A163648 word,easy,nonn
%O A163648 1,1
%A A163648 _Jonathan Vos Post_, Aug 02 2009
%E A163648 Extended and edited by _Charles R Greathouse IV_, Nov 02 2009
%E A163648 Values double-checked by _M. F. Hasler_, Nov 03 2013