id:A080570 - OEIS Search Results

Search: id:A080570

Displaying 1-1 of 1 results found.

page 1

Number of 1's in partition of n-th Ulam number into sum of two distinct Ulam numbers.

+0
2

1, 0, 1, 2, 2, 2, 3, 3, 4, 4, 6, 6, 8, 8, 11, 12, 13, 15, 14, 17, 18, 19, 20, 21, 23, 23, 24, 26, 28, 32, 31, 32, 35, 36, 37, 43, 43, 44, 44, 45, 47, 50, 51, 53, 53, 56, 56, 57, 57, 61, 62, 62, 65, 68, 73, 76, 77, 78, 83, 83, 84, 84, 87, 88, 90, 92, 94, 94, 97, 98, 98, 101, 101 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`For n=7: A002858(7) = 11 = 3+8 = (1+2)+(2+6) = (1+2)+(2+(2+4)) = (1+2)+(2+(2+(1+3))) = (1+2)+(2+(2+(1+(1+2)))). Number of 1's in (1+2)+(2+(2+(1+(1+2)))) is 3, so a(7) = 3.`
	CROSSREFS	`Cf. A002858.` `Adjacent sequences: A080567 A080568 A080569 this_sequence A080571 A080572 A080573` `Sequence in context: A120179 A032739 A029149 this_sequence A029114 A073174 A107631`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 22 2003`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research