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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131690 a(n) = Product prime1(k)^prime1(n-k+1), k = 1 to n. 0
1, 2, 12, 360, 151200, 2095632000, 7551819475200000, 7286477990937425280000000, 16326289449604557795871699200000000000, 48235535472088469901966394717904245153920000000000000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Exponents of the prime factorization are the primes in reverse order. Similar to A087315, but where the largest prime factor has an exponent of one instead of two (and 1^n is understood to be the first term).

FORMULA

a(n) = Product prime1(k)^prime1(n-k+1), k = 1 to n, where prime1 is the sequence of primes prepended with 1.

EXAMPLE

a(5) = 1^7 * 2^5 * 3^3 * 5^2 * 7^1 = 151200

CROSSREFS

Cf. A087315, A076265, A076265.

Sequence in context: A079264 A006939 A152686 * A158261 A012547 A009706

Adjacent sequences:  A131687 A131688 A131689 * A131691 A131692 A131693

KEYWORD

nonn

AUTHOR

Darse Billings (darse(AT)cs.ualberta.ca), Sep 14 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 17 11:46 EST 2012. Contains 206011 sequences.