Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125721
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125721 a(n)=2*n!/d(n!); d(m)=A000005(m) is the number of divisors of m. +0
1
2, 2, 2, 3, 6, 15, 48, 168, 840, 4536, 26880, 147840, 1209600 (list; graph; listen)
OFFSET

0,1

COMMENT

a(3)=3 and a(5)=15 are the only odd numbers in this sequence.

REFERENCES

P. Erdos, solved by J. Fiedler, Elem. Math. 16 (1961), 42-44, Aufgabe 374.

FORMULA

a(n)=2*A000142(n)/A027423(n).

EXAMPLE

a(4)=2*4!/d(4!)=2*24/8=6.

CROSSREFS

Cf. A000142, A027423.

Sequence in context: A147851 A143596 A091712 this_sequence A049798 A165198 A024682

Adjacent sequences: A125718 A125719 A125720 this_sequence A125722 A125723 A125724

KEYWORD

nonn

AUTHOR

Franz Vrabec (franz.vrabec(AT)aon.at), Feb 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research