id:A080573 - OEIS Search Results

Search: id:A080573

Displaying 1-1 of 1 results found.

page 1

Number of ways writing n as a sum of two distinct Ulam numbers.

+0
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; listen)

	OFFSET	`1,5`
	COMMENT	`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: A022921 A080763 A165413 this_sequence A006340 A076371 A106149` `Adjacent sequences: A080570 A080571 A080572 this_sequence A080574 A080575 A080576`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 22 2003`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research