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!)
A065583 Sum of numbers which in base n have (n-1) distinct nonzero digits. 1

%I #15 Aug 16 2022 10:41:16

%S 0,1,12,252,9360,559800,49412160,6039794880,976299609600,

%T 201599999798400,51766949513664000,16177372653293913600,

%U 6044902527410562816000,2661334524326601925401600,1363387181797265578297344000,804077813274862776803112960000,540880443323184957954046525440000

%N Sum of numbers which in base n have (n-1) distinct nonzero digits.

%H G. C. Greubel, <a href="/A065583/b065583.txt">Table of n, a(n) for n = 1..230</a>

%F a(n) = n!*(n^(n-1)-1)/(2*(n-1)) = A001710(n)*A060072(n).

%e a(4) = 252 since we need to sum the base 4 numbers 123, 132, 213, 231, 312 and 321, i.e. the decimal sum 27+30+39+45+54+57 = 252.

%t Table[If[n==1, 0, n!*(n^(n-1) -1)/(2*(n-1))], {n,30}] (* _G. C. Greubel_, Aug 16 2022 *)

%o (Magma) [n eq 1 select 0 else Factorial(n)*(n^(n-1)-1)/(2*(n-1)): n in [1..30]]; // _G. C. Greubel_, Aug 16 2022

%o (SageMath) [0]+[factorial(n)*(n^(n-1)-1)/(2*(n-1)) for n in (2..30)] # _G. C. Greubel_, Aug 16 2022

%Y Cf. A001710, A060072.

%K base,nonn

%O 1,3

%A _Henry Bottomley_, Nov 28 2001

%E More terms from _Benoit Cloitre_, Jan 31 2002

%E More terms from _G. C. Greubel_, Aug 16 2022

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 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)