id:A088904 - OEIS Search Results

Search: id:A088904

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n = x^i + x^j with 1<x<=n and 0<=i<=j.

+0
3

0, 1, 1, 2, 2, 3, 1, 3, 2, 4, 1, 4, 1, 2, 1, 3, 3, 4, 1, 4, 1, 2, 1, 3, 1, 3, 1, 3, 1, 4, 1, 4, 2, 3, 1, 4, 2, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 3, 1, 4, 1, 2, 1, 3, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 4, 3, 1, 4, 1, 2, 1, 5, 1, 2, 1, 2, 1, 2, 1, 4, 1, 4, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 3, 1, 2 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(A088905(n)) = 1;` `a(A088906(n)) = n and a(k) < n for 1 <= k < A088906(n).`
	EXAMPLE	`a(32)=4: 32 = 2^4+2^4 = 4^2+4^2 = 16^1+16^1 = 31^0+31^1;` `a(33)=2: 33 = 2^0+2^5 = 32^0+32^1;` `a(34)=3: 34 = 2^1+2^5 = 17^1+17^1 = 33^0+33^1.`
	CROSSREFS	`Sequence in context: A077083 A083040 A083899 this_sequence A047972 A088741 A004595` `Adjacent sequences: A088901 A088902 A088903 this_sequence A088905 A088906 A088907`
	KEYWORD	`nonn`
	AUTHOR	`Entry completely revised: Hugo Pfoertner (hugo(AT)pfoertner.org) and Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 20 2004`

page 1

Search completed in 0.002 seconds

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.

AT&T Labs Research