Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054844
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054844 Number of ways to write n as the sum of any number of consecutive integers (including the trivial one-term sum n = n). +0
3
2, 2, 4, 2, 4, 4, 4, 2, 6, 4, 4, 4, 4, 4, 8, 2, 4, 6, 4, 4, 8, 4, 4, 4, 6, 4, 8, 4, 4, 8, 4, 2, 8, 4, 8, 6, 4, 4, 8, 4, 4, 8, 4, 4, 12, 4, 4, 4, 6, 6, 8, 4, 4, 8, 8, 4, 8, 4, 4, 8, 4, 4, 12, 2, 8, 8, 4, 4, 8, 8, 4, 6, 4, 4, 12, 4, 8, 8, 4, 4, 10, 4, 4, 8, 8, 4, 8, 4, 4, 12, 8, 4, 8, 4, 8, 4, 4, 6, 12, 6 (list; graph; listen)
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 November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.