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!)
A104643 Number of arrangements that can be formed by taking n distinct things out of 25. 1

%I #11 Sep 08 2022 08:45:17

%S 1,25,600,13800,303600,6375600,127512000,2422728000,43609104000,

%T 741354768000,11861676288000,177925144320000,2490952020480000,

%U 32382376266240000,388588515194880000,4274473667143680000,42744736671436800000,384702630042931200000,3077621040343449600000

%N Number of arrangements that can be formed by taking n distinct things out of 25.

%H G. C. Greubel, <a href="/A104643/b104643.txt">Table of n, a(n) for n = 0..25</a>

%F a(n) = 25! / (25 - n)!.

%e a(3) = 25! / (25 - 3)! = 13800.

%t Table[n!*Binomial[25, n], {n, 0, 25}] (* _G. C. Greubel_, Sep 01 2018 *)

%o (PARI) a(n) = 25! / (25 - n)! ; \\ _Michel Marcus_, Aug 12 2013

%o (Magma) [Factorial(n)*Binomial(25,n): n in [0..25]] // _G. C. Greubel_, Sep 01 2018

%K nonn,fini

%O 0,2

%A Prashant Garg (prashant.garg1988(AT)yahoo.com), Feb 04 2008

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 July 17 12:29 EDT 2024. Contains 374377 sequences. (Running on oeis4.)