login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094003 a(1) = 2, a(n+1) = (a(n)^(n+1) - 1)/(a(n) - 1). 1

%I #18 Sep 08 2022 08:45:13

%S 2,3,13,2380,32098914298781,

%T 34076243757937210559857502330309024747435410425446137941014310689706

%N a(1) = 2, a(n+1) = (a(n)^(n+1) - 1)/(a(n) - 1).

%C a(7) has 406 digits and is too large to include.

%H Harry J. Smith, <a href="/A094003/b094003.txt">Table of n, a(n) for n = 1..7</a>

%p a[1]:=2: for n from 2 to 7 do a[n]:=(a[n-1]^n-1)/(a[n-1]-1) od:seq(a[n],n=1..7); # _Emeric Deutsch_, Apr 17 2005

%t RecurrenceTable[{a[1] == 2, a[n] == (a[n-1]^n - 1)/(a[n-1] -1)}, a, {n, 6}] (* _Vincenzo Librandi_, Dec 20 2015 *)

%o (PARI) { a=2; write("b094003.txt", "1 2"); for (n=2, 7, a=(a^n-1)/(a-1); write("b094003.txt", n, " ", a); ) } \\ _Harry J. Smith_, Jun 16 2009

%o (Magma) [n le 1 select 2 else (Self(n-1)^n - 1)/(Self(n-1) - 1): n in [1..6]]; // _Vincenzo Librandi_, Dec 20 2015

%K nonn

%O 1,1

%A _Amarnath Murthy_, May 29 2004

%E More terms from _Emeric Deutsch_, Apr 17 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)