login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080573 Number of ways writing n as a sum of two distinct Ulam numbers. 1
0, 0, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 3, 2, 1, 3, 1, 4, 2, 2, 2, 0, 3, 0, 1, 2, 1, 4, 2, 2, 2, 0, 3, 0, 1, 2, 1, 4, 2, 2, 3, 0, 4, 0, 2, 1, 1, 4, 2, 3, 2, 1, 5, 2, 3, 1, 2, 3, 2, 3, 1, 3, 5, 3, 4, 0, 2, 1, 3, 2, 1, 5, 3, 5, 2, 1, 3, 2, 4, 2, 1, 5, 2, 6, 2, 1, 5, 2, 5, 2, 0, 4, 0, 6, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

After about 10^5 terms, the plot of this sequences begins to show some structure. - T. D. Noe, Jan 21 2008

LINKS

T. D. Noe, Table of n, a(n) for n=1..10000

T. D. Noe, Plot of 10^5 terms of A080573

CROSSREFS

Cf. A002858, A033629.

Sequence in context: A080763 A165413 A172155 * A186440 A006340 A076371

Adjacent sequences:  A080570 A080571 A080572 * A080574 A080575 A080576

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 22 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:43 EST 2012. Contains 205904 sequences.