Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117481
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117481 Numbers a(n)=n*(n-1)*(n-2)*(n-3)*...*(n-k) such that (n-k) is the largest prime number smaller than n. +0
1
1, 2, 6, 12, 60, 30, 210, 56, 504, 5040, 55440, 132, 1716, 182, 2730, 43680, 742560, 306, 5814, 380, 7980, 175560, 4037880, 552, 13800, 358800, 9687600, 271252800, 7866331200, 870, 26970, 992, 32736, 1113024, 38955840, 1401410240, 51889178880 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=n*(n-1)*(n-2)*(n-3)*...*(n-k)

EXAMPLE

a(10)=10*9*8*7=5040 because 7 is the largest possible prime number smaller than 10.

CROSSREFS

Sequence in context: A119862 A111936 A002805 this_sequence A083268 A085911 A058312

Adjacent sequences: A117478 A117479 A117480 this_sequence A117482 A117483 A117484

KEYWORD

nonn

AUTHOR

Luc Stevens (lms022(AT)yahoo.com), Apr 25 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research