The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077224 a(0) = 1; for n > 1, a(n) = smallest number > a(n-1) such that a(n) + a(k) is squarefree for k = 1 to n-1. 6
 1, 2, 4, 9, 13, 29, 33, 101, 105, 109, 157, 177, 253, 289, 301, 353, 409, 429, 465, 501, 533, 553, 589, 609, 681, 753, 877, 933, 965, 1153, 1477, 1905, 1977, 2101, 2125, 2229, 2305, 2405, 2605, 2657, 2801, 2913, 3305, 3381, 3489, 3565, 3777, 3781, 3881, 4029 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Or, sum of any two terms is a squarefree number. LINKS Amiram Eldar, Table of n, a(n) for n = 0..1800 FORMULA It can easily be proved that a(n) == 1 mod 4 for all n > 3. EXAMPLE 13 is a member as 13 + 1, 13 + 2, 13 + 4, 13 + 9 are all squarefree. MATHEMATICA a[0] = 1; a[n_] := a[n] = Module[{t = Array[a, n, 0], k = a[n - 1] + 1}, While[AnyTrue[t, ! SquareFreeQ[k + #] &], k++]; k]; Array[a, 100, 0] (* Amiram Eldar, Aug 21 2023 *) CROSSREFS Cf. A005117, A077225, A080793, A085902. Sequence in context: A090942 A328656 A085901 * A059447 A234899 A190553 Adjacent sequences: A077221 A077222 A077223 * A077225 A077226 A077227 KEYWORD nonn AUTHOR Amarnath Murthy, Nov 03 2002 EXTENSIONS Edited by Sam Alexander, Dec 12 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)