The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129913 a(n) is the number of ways of producing n, with an expression like: +- 1 # 2 # 3 # 4 # 5 # 6 # 7 # 8 # 9, where each # is replaced by any one of +,-,*,/; and the value is computed going left to right. 1
 694, 299, 143, 171, 156, 156, 183, 155, 167, 434, 160, 140, 129, 111, 89, 147, 114, 201, 171, 94, 87, 90, 68, 95, 130, 130, 44, 120, 41, 72, 76, 72, 50, 81, 50, 53, 137, 49, 46, 78, 41, 75, 36, 61, 28, 123, 35, 86, 47, 40, 40, 47, 40, 37, 109, 61, 32, 58, 23, 53 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Don Reble, Table of n, a(n) for n = 0..1000 Don Reble, C++ program to compute sequence EXAMPLE Going left-to-right, +1-2/3-4-5*6/7+8*9 = 0; and there are 694 such expressions which yield zero, so a(0)=694. CROSSREFS Sequence in context: A004240 A004241 A322154 * A031946 A049356 A020385 Adjacent sequences: A129910 A129911 A129912 * A129914 A129915 A129916 KEYWORD easy,nonn AUTHOR Jason Rodgers (Jason628(AT)gmail.com), Jun 05 2007, Jun 06 2007 EXTENSIONS Corrected and edited by Don Reble, Jun 23 2008 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.

Last modified May 30 02:13 EDT 2024. Contains 372957 sequences. (Running on oeis4.)