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.

A133955 The smallest prime p for which there is an integer m such that the home sequence of m has n terms and terminates at p.

This page as a plain text file.
%I A133955 #9 Aug 11 2024 14:41:34
%S A133955 2,23,211,773,773,13367,3411949,236122171,3129706267,3314192745739,
%T A133955 711114155396657,331149818444273,3331113965338635107,
%U A133955 3331113965338635107,7241721710291471119,3318308475676071413
%N A133955 The smallest prime p for which there is an integer m such that the home sequence of m has n terms and terminates at p.
%C A133955 Starting number is: 2, 6, 4, 25, 10, 14, 45, 91, 78, 40, 150, 135, 126, 8, 104, 20, 212, 86, 87, 65, 340, 604, 894, 341, 123, 105, 345, 1810, ..., . - _Robert G. Wilson v_, Sep 22 2007
%H A133955 P. De Geest, <a href="https://www.worldofnumbers.com/topic1.htm">Home Primes < 100 and Beyond</a>
%e A133955 23 is the home prime of both 6 and 23, thus a(2) = 23; 211 is the home prime of 6, 22 and 211, thus a(3) = 211.
%t A133955 t = Table[0, {28}]; f[n_] := FromDigits@ Flatten[ IntegerDigits@ Table[ #[[1]], { #[[2]] }] & /@ FactorInteger@n, 2]; h[n_] := NestWhileList[f@# &, n, !PrimeQ@# &, 1, 28]; Do[ a = h@n; If[ t[[Length@a]] == 0, t[[Length@a]] = a[[ -1]]; Print[{Length@a, n, a[[ -1]]}]], {n, 2, 2500}]; t (* _Robert G. Wilson v_, Sep 22 2007 *)
%Y A133955 Cf. A037274, A118756.
%K A133955 nonn,base
%O A133955 1,1
%A A133955 William Lindgren (william.lindgren(AT)sru.edu) & _Robert G. Wilson v_, Sep 30 2007