|
| |
|
|
A007843
|
|
Least positive integer k for which 2^n divides k!.
|
|
11
| |
|
|
1, 2, 4, 4, 6, 8, 8, 8, 10, 12, 12, 14, 16, 16, 16, 16, 18, 20, 20, 22, 24, 24, 24, 26, 28, 28, 30, 32, 32, 32, 32, 32, 34, 36, 36, 38, 40, 40, 40, 42, 44, 44, 46, 48, 48, 48, 48, 50, 52, 52, 54, 56, 56, 56, 58, 60, 60, 62, 64, 64, 64, 64, 64, 64, 66, 68, 68, 70, 72, 72, 72, 74, 76, 76, 78
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Obtained by writing every natural number n k times where 2^k divides n but 2^(k+1) does not divide n. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 22 2002
|
|
|
REFERENCES
| H. Ibstedt, Smarandache Primitive Numbers, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997, 216-229.
F. Smarandache, "Only Problems, not Solutions!", Xiquan Publ., Phoenix-Chicago, 1993.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..1000
M. L. Perez et al., eds., Smarandache Notions Journal
F. Smarandache, Only Problems, Not Solutions!.
|
|
|
FORMULA
| a(n)=A002034(2^n). For n>1, it appears that a(n+1)=a(n)+2 if n is in A005187. - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 01 2002
|
|
|
MAPLE
| with(numtheory): ans := [ ]: p := ithprime(1): t0 := 1/p: for n from 0 to 50 do t0 := t0*p: t1 := 1: i := 1: while t1 mod t0 <> 0 do i := i+1: t1 := t1*i: od: ans := [ op(ans), i ]: od: ans;
|
|
|
MATHEMATICA
| a[n_] := (k=0; While[Mod[++k!, 2^n] > 0]; k); Table[a[n], {n, 0, 74}] (* From Jean-François Alcover, Dec 08 2011 *)
|
|
|
PROG
| (PARI) a(n)=if(n<0, 0, s=1; while(s!%(2^n)>0, s++); s)
|
|
|
CROSSREFS
| Cf. A007844, A007845, A020646, A048841-A048846.
Sequence in context: A135692 A089003 A132118 * A053196 A159634 A186690
Adjacent sequences: A007840 A007841 A007842 * A007844 A007845 A007846
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Bruce Dearden and Jerry Metzger (metzger(AT)rs1.cc.und.nodak.edu); R. Muller
|
| |
|
|
