Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067174
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067174 Product of the sum of all the subsets of the numbers from 1 to n. +0
1
1, 6, 2160, 9144576000, 47354185460054753280000000, 18458571748581562066056556704775089466054740541440000000000000, 47233748702462500435567511289038040021397635763497380756284093804903384444460824\ 501772093090703929198069912961024000000000000000000000000000 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(3) = 1 * 2 * 3 * (1+2) * (1+3) * (2+3) * (1+2+3) = 1*2*3*3*4*5*6 = 2160

MAPLE

with(combinat, subsets): A067174 := proc(n) local S, ans, i: S := subsets([seq(i, i=1..n)]): ans := 1: S[nextvalue](): while not S[finished] do ans := ans*add(i, i=S[nextvalue]()) od: RETURN(ans): end:

CROSSREFS

Sequence in context: A059081 A056048 A051113 this_sequence A153300 A059203 A069643

Adjacent sequences: A067171 A067172 A067173 this_sequence A067175 A067176 A067177

KEYWORD

nonn

AUTHOR

Jonathan Ayres (jonathan.ayres(AT)ntlworld.com), Jan 06 2002

EXTENSIONS

More terms from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Jan 06 2002

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research