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.

A096058 a(1) = 1, a(n) = largest prime divisor of b(n), where b(1) = 1, b(n) = n*b(n-1) + 1 = A002627(n).

This page as a plain text file.
%I A096058 #19 Oct 29 2024 03:28:06
%S A096058 1,3,5,41,103,1237,433,2389,2711,145007,523,164611949,232603841,
%T A096058 201069629,132267077,35951249665217,204405098431,392881768421,
%U A096058 52255141388393,8098687,43894318766250120011,386270005143001056097
%N A096058 a(1) = 1, a(n) = largest prime divisor of b(n), where b(1) = 1, b(n) = n*b(n-1) + 1 = A002627(n).
%H A096058 Amiram Eldar, <a href="/A096058/b096058.txt">Table of n, a(n) for n = 1..69</a>
%F A096058 a(n) = A006530(A002627(n)).
%e A096058 a(4) = 41 because b(3) = 3*b(2)+1 = 3*3+1 = 10 and 4*10+1 = 41, which is prime.
%e A096058 b(n) = 1, 3, 10, 41, ... with largest prime divisors a(n) = 1, 3, 5, 41, ...
%t A096058 nxt[{n_,a_}]:={n+1,a(n+1)+1}; FactorInteger[#][[-1,1]]&/@NestList[nxt,{1,1},25][[;;,2]] (* _Harvey P. Dale_, Jul 22 2024 *)
%Y A096058 Cf. A096057, A006530, A002627, A096057.
%K A096058 nonn
%O A096058 1,2
%A A096058 _Amarnath Murthy_, Jun 17 2004
%E A096058 Corrected and extended by _Ray G. Opao_, Aug 02 2004
%E A096058 Edited by _Jonathan Sondow_, Jan 09 2005