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.

A238579 Home prime sequence (see A037274) starting at 146.

This page as a plain text file.
%I A238579 #56 May 14 2022 19:50:20
%S A238579 146,273,3713,4779,333359,1325643,3111717139,29177760383,69142225413,
%T A238579 3471134339561,7980350584141,1324115101168677,33147123900129853,
%U A238579 1941131324815763997,37816317113233982621,291304010934939102849,333777134924210136703397,7409854792211363875345439
%N A238579 Home prime sequence (see A037274) starting at 146.
%C A238579 Second sequence of this kind with as yet unknown trajectory (see A037274, A056938). - _J. Lowell_, Apr 27 2017
%H A238579 Sean A. Irvine, <a href="/A238579/b238579.txt">Table of n, a(n) for n = 1..100</a>
%H A238579 Wikipedia, <a href="https://en.wikipedia.org/wiki/Home_prime">Home prime</a>
%e A238579 146 = 2*73 so next term is 273; 273 = 3*7*13 so next term is 3713.
%t A238579 NestList[FromDigits@ Flatten@ Map[IntegerDigits, FactorInteger[#] /. {p_, e_} /; p >= 1 :> If[p == 1, 1, ConstantArray[p, e]]] &, 146, 17] (* _Michael De Vlieger_, Apr 27 2017 *)
%o A238579 (PARI) lista(nn) = {n = 146; for (i=1 , nn, print1(n, ", "); f = factor(n); s = ""; for (j=1, #f~, for (k=1, f[j, 2], s = concat(s, Str(f[j, 1])););); n = eval(s););} \\ _Michel Marcus_, Mar 31 2014
%Y A238579 Cf. A037274 (home primes), A056938.
%K A238579 nonn,base
%O A238579 1,1
%A A238579 _J. Lowell_, Mar 30 2014
%E A238579 One more term added by _J. Lowell_, Mar 30 2014
%E A238579 More terms from _Jon E. Schoenfield_, Mar 30 2014
%E A238579 One further term from _N. J. A. Sloane_, Mar 31 2014