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.

A133959 Home primes whose homeliness is greater than 2.

This page as a plain text file.
%I A133959 #5 Apr 28 2015 14:56:26
%S A133959 211,223,311,337,373,379,389,547,571,773,1123,1129,1153,1319,1931,
%T A133959 2237,2311,2341,2347,2371,2383,2389,2557,2719,2797,2953,2971,3137,
%U A133959 3167,3181,3191,3251,3257,3313,3329,3331,3347,3359,3373,3389,3449,3457,3461,3463
%N A133959 Home primes whose homeliness is greater than 2.
%C A133959 Number of terms < 10^n: 0, 0, 10, 91, 658, 5076, 39095, ....
%e A133959 {4, 22, 211} -> 211, etc.
%t A133959 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, 10^7}];
%t A133959 d = 3 - 2; lsu = {}; Do[ If[ lst[[n]] == lst[[n + d]], AppendTo[ lsu, lst[[n]] ]], {n, 188004 - d - 1}]; Take[ Union@ lsu, 45]
%Y A133959 Cf. A037274, A118756, A133957, A133961, A133963, A133965, A133967, A133969, A133971, A133973, A133975, A133977, A133979.
%K A133959 nonn,base
%O A133959 1,1
%A A133959 _Robert G. Wilson v_, Sep 30 2007