login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070176 Let s(n) be smallest number >= n which is a sum of two squares (A001481); sequence gives s(n) - n. 3
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; refs; listen; history; internal format)
OFFSET

0,7

COMMENTS

It is an unsolved problem to determine the rate of growth of this sequence.

a(A001481(n)) = 0; a(A022544(n)) > 0. [Reinhard Zumkeller, Feb 04 2012]

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

PROG

(Haskell)

a070176 n = (head $ dropWhile (< n) a001481_list) - n

a070176_list = map a070176 [0..]

-- Reinhard Zumkeller, Feb 04 2012

CROSSREFS

Sequence in context: A167365 A025894 A051127 * A092606 A073253 A004198

Adjacent sequences:  A070173 A070174 A070175 * A070177 A070178 A070179

KEYWORD

nonn,easy,nice,changed

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.