login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134486 a(0)=1; for n>=1, a(n) = the largest prime dividing n*a(n-1) + 1. 1

%I

%S 1,2,5,2,3,2,13,23,37,167,557,383,4597,29881,167,179,191,29,523,4969,

%T 211,277,53,61,293,37,107,17,53,769,23071,661,641,1511,137,109,157,83,

%U 631,107,1427,14627,122867,103,1511,191,101,1187,251,41,293,467,1619

%N a(0)=1; for n>=1, a(n) = the largest prime dividing n*a(n-1) + 1.

%t a = {1, 2};Do[AppendTo[a, FactorInteger[Length[a]*a[[ -1]] + 1][[ -1, 1]]], {70}]; a (* _Stefan Steinerberger_, Oct 30 2007 *)

%Y Similar to A134487 but with different value of a(0).

%K nonn

%O 0,2

%A _Leroy Quet_, Oct 28 2007

%E More terms from _Stefan Steinerberger_, Oct 30 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 03:34 EDT 2019. Contains 328211 sequences. (Running on oeis4.)