id:A141747 - OEIS Search Results

Search: id:A141747

Displaying 1-1 of 1 results found.

page 1

a(n) = number of nonnegative integer pairs i,j such that n = 2^i + 3^j.

+0
2

0, 1, 1, 1, 2, 0, 1, 0, 1, 1, 2, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,5`
	EXAMPLE	`a(5) = 2, using (i,j) = (1,1) and (2,0).`
	CROSSREFS	`Cf. A141748, A085634.` `Sequence in context: A014944 A015879 A016242 this_sequence A066416 A091991 A108234` `Adjacent sequences: A141744 A141745 A141746 this_sequence A141748 A141749 A141750`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Jul 01 2008`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research