Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094261
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094261 a(n)=n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceil([sqrt(1+8*n)-1]/2). +0
1
1, 2, 6, 12, 40, 90, 168, 560, 1296, 2520, 4400, 14256, 32760, 64064, 113400, 187200, 586432, 1321920, 2560896, 4522000, 7484400, 11797632, 35784320, 78871968, 150480000, 263120000, 433060992, 681080400, 1033305728, 3044304000 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(8)=8(8-1)(8-3)(8-6)=8*7*5*2=560.

MAPLE

a:=n->product(n-k*(k+1)/2, k=0..ceil((sqrt(1+8*n)-1)/2)-1): seq(a(n), n=1..35); (Deutsch)

CROSSREFS

Cf. A094262.

Sequence in context: A074442 A162589 A123045 this_sequence A080497 A127724 A056744

Adjacent sequences: A094258 A094259 A094260 this_sequence A094262 A094263 A094264

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 26 2004

EXTENSIONS

Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 03 2006

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research