id:A070176 - OEIS Search Results

Search: id:A070176

Displaying 1-1 of 1 results found.

page 1

Let s(n) be smallest number >= n which is a sum of two squares (A001481); sequence gives s(n) - n.

+0
1

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

	OFFSET	`0,7`
	COMMENT	`It is an unsolved problem to determine the rate of growth of this sequence.`
	REFERENCES	`H. L. Montgomery, Ten Lectures on the Interface Between Analytic Number Theory and Harmonic Analysis, Amer. Math. Soc., 1996, p. 208.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000`
	CROSSREFS	`Sequence in context: A167365 A025894 A051127 this_sequence A092606 A073253 A004198` `Adjacent sequences: A070173 A070174 A070175 this_sequence A070177 A070178 A070179`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 13 2002`
	EXTENSIONS	`More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jun 15 2002`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research