Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129364
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129364 Product A066841(k), k = 1..n. +0
3
1, 2, 6, 96, 480, 207360, 1451520, 2972712960, 722369249280, 5778953994240000, 63568493936640000, 9111096278347394580480000, 118444251618516129546240000, 10400352846118664303196241920000 (list; graph; listen)
OFFSET

1,2

COMMENT

Conjecture: a(n) divides A092287(n) for all n - see comments in A129365.

FORMULA

a(n) = product[product{d|k} d^(k/d)], k = 1..n. a(n) = product[((floor(n/k))!)^k], k = 1..n.

CROSSREFS

Cf. A007955, A066841, A092143, A092287, A129365.

Adjacent sequences: A129361 A129362 A129363 this_sequence A129365 A129366 A129367

Sequence in context: A128265 A087277 A007188 this_sequence A092287 A035482 A007870

KEYWORD

easy,nonn

AUTHOR

Peter Bala (pbala(AT)toucansurf.com), Apr 11 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 October 12 14:39 EDT 2008. Contains 144830 sequences.


AT&T Labs Research