|
Search: id:A050366
|
|
|
| A050366 |
|
Number of ways to write n as an lterm, where an lterm is an unordered sum which is either 2, or 1 + an ordered product of lterms. |
|
+0
3
|
|
| 1, 1, 1, 2, 2, 4, 4, 7, 8, 12, 12, 21, 21, 29, 33, 46, 46, 67, 67, 93, 101, 125, 125, 177, 181, 223, 238, 300, 300, 394, 394, 488, 512, 604, 620, 796, 796, 930, 972, 1182, 1182, 1450, 1450, 1712, 1804, 2054, 2054, 2510, 2526, 2924, 3016, 3483, 3483
(list; graph; listen)
|
|
|
OFFSET
|
2,4
|
|
|
FORMULA
|
Shifts left under transform T where Ta has Dirichlet g.f.: 1/(1-A(s)).
|
|
EXAMPLE
|
The different ways of writing the numbers 2 through 7 as mterms are:
2=2
3=1+2
4=1+(1+2)
5=1+(1+1+2)=1+2*2
6=1+(1+1+1+2)=1+(1+2*2)
7=1+(1+1+1+1+2)=1+(1+1+2*2)=1+2*(1+2)=1+(1+2)*2
|
|
CROSSREFS
|
Cf. A002033, A050318, A050319, A050365.
Sequence in context: A100471 A095700 A035944 this_sequence A027591 A027596 A007213
Adjacent sequences: A050363 A050364 A050365 this_sequence A050367 A050368 A050369
|
|
KEYWORD
|
nonn,eigen
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Oct 15 1999.
|
|
|
Search completed in 0.002 seconds
|
