Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025048 Ascending wiggly sums: number of sums adding to n in which terms alternately increase and decrease. +0
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; listen)
OFFSET

1,3

FORMULA

a(n) = 1+A025047(n)-A025049(n) = sum_k[A059882(n, k)] - Henry Bottomley (se16(AT)btinternet.com), Feb 05 2001

CROSSREFS

Adjacent sequences: A025045 A025046 A025047 this_sequence A025049 A025050 A025051

Sequence in context: A120415 A023361 A113435 this_sequence A017987 A039897 A050193

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research