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.

A133958 Home primes whose homeliness is 2.

This page as a plain text file.
%I A133958 #11 Mar 23 2021 15:43:13
%S A133958 37,227,229,233,241,257,271,277,283,313,317,331,347,353,359,367,383,
%T A133958 397,523,541,557,577,719,743,761,797,1117,1171,1361,1367,1373,1723,
%U A133958 1741,1747,1753,1759,1783,1789,1973,1979,1997,2113,2131,2137,2179,2213,2239
%N A133958 Home primes whose homeliness is 2.
%C A133958 Number of terms < 10^n: 0, 1, 26, 182, 1428, 10395, 84164, ... .
%e A133958 Only {21 & 37} -> 37, etc.
%t A133958 lst = {}; f[n_] := FromDigits@ Flatten[ IntegerDigits@ Table[ #[[1]], {#[[2]]}] & /@ FactorInteger@n, 2]; h[n_] := NestWhileList[f@# &, n, !PrimeQ@# &, 1, 28]; Do[p = h[n][[ -1]]; If[ PrimeQ@p && p < 10^7 && p != n, Print[{n, p}]; AppendTo[lst, p]], {n, 2, 1000}];
%t A133958 d = 2 - 2; lsu = {}; Do[ If[ lst[[n]] == lst[[n + d]] && lst[[n-1]] != lst[[n]] && lst[[n]] != lst[[n + d + 1]], AppendTo[lsu, lst[[n]]]], {n, 188004 - d - 1}]; Take[ Union@ lsu, 50]
%Y A133958 Cf. A037274, A118756, A133957, A133956, A133960, A133962, A133964, A133966, A133968, A133970, A133972, A133974, A133976, A133978.
%K A133958 nonn,base
%O A133958 1,1
%A A133958 _Robert G. Wilson v_, Sep 30 2007