A045701 - OEIS

This site is supported by donations to The OEIS Foundation.

A045701

Number of ways n can be written as a sum of a square of a prime and a cube of a prime.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	LINKS	`Ray Chandler, Table of n, a(n) for n = 1..10000`
	EXAMPLE	`a(12) = 1 because 12=2^2+2^3; a(17) = 1 because 17=2^3+3^2.` `a(129) = 2 because 129 = 2^3+11^2 = 2^2+5^3.`
	CROSSREFS	`Cf. A045699, A045700, A196752, A196753.` `Sequence in context: A107846 A179801 A065202 * A193095 A011725 A037808` `Adjacent sequences: A045698 A045699 A045700 * A045702 A045703 A045704`
	KEYWORD	`easy,nonn`
	AUTHOR	`Felice Russo (frusso(AT)micron.com)`
	EXTENSIONS	`More terms from Erich Friedman (erich.friedman(AT)stetson.edu).`

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

Last modified February 15 08:12 EST 2012. Contains 205724 sequences.