|
Search: id:A048249
|
|
|
| A048249 |
|
Number of unique values produced from sums and products of n unity arguments. |
|
+0
2
|
|
| 1, 2, 3, 4, 6, 9, 11, 17, 23, 30, 44, 60, 80, 114, 156, 212, 296, 404, 556, 770, 1065, 1463, 2032, 2795, 3889, 5364, 7422, 10300, 14229, 19722, 27391, 37892, 52599, 73075, 101301, 140588, 195405, 271024, 376608, 523518, 726812, 1010576
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Values listed calculated by exhaustive search algorithm.
For n+1 operands (n operations) there are (2n)!/((n!)((n+1)!)) possible postfix forms over a single operator. For each such form, there are 2^n ways to assign 2 operators (here, sum and product). Calculate results and eliminate duplicates.
|
|
LINKS
|
Index entries for similar sequences
|
|
FORMULA
|
Equals partial sum of "number of numbers of complexity n" (A005421). - Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 07 2006
|
|
EXAMPLE
|
a(3)=3 since (in postfix): 111** = 11*1* = 1, 111*+ = 11*1+ = 111+* = 11+1* = 2 and 111++ = 11+1+ = 3. Note that at n=7, the 11 possible values produced are the set {1,2,3,4,5,6,7,8,9,10,12}. This is the first n for which there are "skipped" values in the set.
|
|
CROSSREFS
|
Sequence in context: A130899 A007210 A035947 this_sequence A018471 A128166 A112249
Adjacent sequences: A048246 A048247 A048248 this_sequence A048250 A048251 A048252
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Tony Bartoletti (azb(AT)home.com)
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Oct 10 2001
|
|
|
Search completed in 0.002 seconds
|
