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!)
A125598 a(n) = ((n+1)^(n-1) - 1)/n. 3

%I #42 Aug 15 2022 04:24:50

%S 0,1,5,31,259,2801,37449,597871,11111111,235794769,5628851293,

%T 149346699503,4361070182715,139013933454241,4803839602528529,

%U 178901440719363487,7143501829211426575,304465936543600121441

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

%C Odd prime p divides a(p-2).

%C a(n) is prime for n = {3,4,6,74, ...}; prime terms are {5, 31, 2801, ...}.

%C a(n) is the (n-1)-th generalized repunit in base (n+1). For example, a(5) = 259 which is 1111 in base 6. - _Mathew Englander_, Oct 20 2020

%H G. C. Greubel, <a href="/A125598/b125598.txt">Table of n, a(n) for n = 1..350</a>

%F a(n) = ((n+1)^(n-1) - 1)/n.

%F a(n) = (A000272(n+1) - 1)/n.

%F a(2k-1)/(2k+1) = A125599(k) for k>0.

%F From _Mathew Englander_, Dec 17 2020: (Start)

%F a(n) = (A060072(n+1) - A083069(n-1))/2.

%F For n > 1, a(n) = Sum_{k=0..n-2} (n+1)^k.

%F For n > 1, a(n) = Sum_{j=0..n-2} n^j*C(n-1,j+1). (End)

%t Table[((n+1)^(n-1)-1)/n, {n,25}]

%o (Sage) [gaussian_binomial(n,1,n+2) for n in range(0,18)] # _Zerinvary Lajos_, May 31 2009

%o (Magma) [((n+1)^(n-1) -1)/n: n in [1..25]]; // _G. C. Greubel_, Aug 15 2022

%Y Cf. A000272 (n^(n-2)), A125599.

%Y Cf. other sequences of generalized repunits, such as A125118, A053696, A055129, A060072, A031973, A173468, A023037, A119598, A085104, and A162861.

%K nonn

%O 1,3

%A _Alexander Adamchuk_, Nov 26 2006

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)