This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025048 Ascending wiggly sums: number of sums adding to n in which terms alternately increase and decrease. 9
 1, 1, 2, 3, 4, 7, 11, 16, 26, 41, 64, 100, 158, 247, 389, 612, 960, 1509, 2372, 3727, 5858, 9207, 14468, 22738, 35737, 56164, 88268, 138726, 218024, 342652, 538524, 846358, 1330160, 2090522, 3285526, 5163632, 8115323, 12754288, 20045027, 31503382 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 FORMULA a(n) = 1+A025047(n)-A025049(n) = sum_k[A059882(n, k)]. - Henry Bottomley, Feb 05 2001 a(n) ~ c * d^n, where d = 1.571630806607064114100138865739690782401305155950789062725011227781640624..., c = 0.4408955566119650057730070154620695491718230084159159991449729825619... . - Vaclav Kotesovec, Sep 12 2014 EXAMPLE See A025047. CROSSREFS Sequence in context: A210518 A113435 A222022 * A017987 A222023 A221997 Adjacent sequences:  A025045 A025046 A025047 * A025049 A025050 A025051 KEYWORD nonn AUTHOR STATUS approved

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

Last modified November 13 13:15 EST 2018. Contains 317149 sequences. (Running on oeis4.)