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.

A006919 Write down all the prime divisors in previous term.

This page as a plain text file.
%I A006919 M4581 #21 Oct 07 2022 15:47:24
%S A006919 8,222,2337,31941,33371313,311123771,7149317941,22931219729,
%T A006919 112084656339,3347911118189,11613496501723,97130517917327,
%U A006919 531832651281459,3331113965338635107,3331113965338635107
%N A006919 Write down all the prime divisors in previous term.
%D A006919 H. Jaleebi, personal communication.
%D A006919 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006919 Patrick De Geest, <a href="http://www.worldofnumbers.com/topic1.htm">Home Primes</a>
%F A006919 a(n+1) = A037276(a(n)), a(1) = 8. - _M. F. Hasler_, Oct 07 2022
%t A006919 g[ n_ ] := (x = n; d = {}; While[ FactorInteger[ x ] != {}, f = FactorInteger[ x, FactorComplete -> True ][ [ 1, 1 ] ]; x = x/f; AppendTo[ d, IntegerDigits[ f ] ] ]; FromDigits[ Flatten[ d ] ]); NestList[ g, 8, 15 ]
%t A006919 NestList[FromDigits[Flatten[IntegerDigits/@(Table[First[#],{Last[#]}]& /@ FactorInteger[#])]]&,8,15] (* _Harvey P. Dale_, Dec 04 2011 *)
%o A006919 (PARI) first(N, a=8)=vector(N,i,if(i>1,a=A037276(a),a)) \\ _M. F. Hasler_, Oct 07 2022
%Y A006919 Cf. A056938 (same for a(1)=49), A037271-A037276, A048985, A048986, A049065.
%K A006919 nonn,base,nice
%O A006919 1,1
%A A006919 _N. J. A. Sloane_
%E A006919 More terms from _Robert G. Wilson v_, Sep 05 2000, who remarks that sequence stabilizes at 13th term with a prime.