Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092978
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092978 (Product of first n even numbers)/(product of first k odd numbers) where k is chosen to give the least integer. +0
1
2, 8, 16, 128, 256, 3072, 6144, 98304, 196608, 3932160, 7864320, 188743680, 25165824, 704643072, 21139292160, 676457349120, 1352914698240, 48704929136640, 4638564679680, 185542587187200, 7792788661862400 (list; graph; listen)
OFFSET

1,1

FORMULA

For n even, a(n+1)=2*a(n); for n odd, a(n+1)=2(n+1)*a(n). For n even, a(n)=[2^(3n/2)]*(n/2)!; for n odd, a(n)=[2^( (3n-1)/2)]*((n-1)/2)!. - Mark Hudson (mrmarkhudson(AT)hotmail.com), Jul 23 2004

EXAMPLE

a(5) = 256 = (2*4*6*8*10)/(1*3*5) as (2*4*6*8*10)/(1*3*5*7) is not an integer, here k = 3.

CROSSREFS

Sequence in context: A100736 A099888 A046161 this_sequence A101059 A101658 A006573

Adjacent sequences: A092975 A092976 A092977 this_sequence A092979 A092980 A092981

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 27 2004

EXTENSIONS

More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Jul 23 2004

Corrected and extended by Sam Handler (sam_5_5_5_0(AT)yahoo.com), Oct 23 2004

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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research