login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125059 Number of digits in n!!. 0
1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 5, 5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 15, 16, 16, 17, 18, 19, 19, 20, 21, 22, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

EXAMPLE

a(5)=2 because 5!! = 5*3*1 = 15

MAPLE

SFACT:= proc(n) local i, j, k; for k from 1 by 1 to n do i:=k; j:=k-2; while j >0 do i:=i*j; j:=j-2; od: j:=0; while i>0 do i:=trunc(i/10); j:=j+1; od; print(j) od; end: SFACT(100);

CROSSREFS

Cf. A034886.

Sequence in context: A115384 A131411 A194202 * A029112 A029094 A003105

Adjacent sequences:  A125056 A125057 A125058 * A125060 A125061 A125062

KEYWORD

easy,nonn,base

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Jan 08 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.