login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090787 Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed. 1
1, 1, 1, 0, 1, 2, 1, 0, 1, 2, 1, 0, 0, 2, 3, 1, 0, 0, 1, 2, 2, 1, 0, 1, 3, 3, 2, 2, 2, 1, 1, 3, 2, 0, 2, 3, 1, 1, 3, 4, 2, 1, 1, 2, 3, 3, 4, 2, 1, 2, 2, 1, 0, 3, 6, 5, 3, 1, 3, 3, 2, 3, 2, 3, 5, 5, 3, 4, 6, 4, 2, 1, 2, 4, 4, 5, 6, 7, 5, 2, 2, 2, 3, 5, 6, 4, 2, 6, 7, 4, 4, 4, 2, 2, 7, 9, 6, 3, 4, 7, 6, 4, 2, 4, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
Sequence suggested by Leroy Quet in SeqFan memo 3500 dated Feb 02 2004, where the first fifteen terms were given.
LINKS
Rémy Sigrist, C program
EXAMPLE
a(55)=6, since 55 = 1+2+3+4+5+6+7+8+9+10 = 1*2*3+4+5+6+7+8+9+10 = 1*2+3+4*5+6+7+8+9 = 1+2+3+4+5*6+7+8 = 1*2*3+4+5*6+7+8 = 1+2*3*4+5*6.
PROG
(C) See Links section.
CROSSREFS
Sequence in context: A358074 A170968 A114114 * A351559 A229707 A262680
KEYWORD
nonn
AUTHOR
John W. Layman, Feb 09 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)