login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036603 a(n) = n! in binary. 26

%I

%S 1,1,10,110,11000,1111000,1011010000,1001110110000,1001110110000000,

%T 1011000100110000000,1101110101111100000000,

%U 10011000010001010100000000,11100100011001111110000000000,101110011001010001100110000000000,1010001001100001110110010100000000000

%N a(n) = n! in binary.

%D Donald E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.3.1, Table 1.

%H Alois P. Heinz, <a href="/A036603/b036603.txt">Table of n, a(n) for n = 0..167</a>

%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>

%t FromDigits/@(IntegerDigits[#, 2]&/@(Range[0, 15]!)) (* _Harvey P. Dale_, Feb 05 2012 *)

%t BaseForm[Range[0, 15]!, 2] (* _Alonso del Arte_, May 19 2017 *)

%Y Cf. A000142, A049606.

%K nonn,easy,base

%O 0,3

%A _N. J. A. Sloane_.

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 August 14 08:08 EDT 2020. Contains 336480 sequences. (Running on oeis4.)