This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A245289 #15 Dec 15 2014 07:37:56 %S A245289 2,6,14,17,19,22,26,30,34,38,42,53,55,58,66,70,78,86,89,91,94,102,106, %T A245289 110,114,130,138,142,158,161,163,166,170,178,182,186,194,197,199,202, %U A245289 210,214,218,222,230,233,235,238,249 %N A245289 Balanced squarefrees (of order one): squarefree numbers which are the average of the previous squarefree number and the following squarefree number. %C A245289 All even a(n) are numbers of the form 4k + 2 (as with all even squarefree numbers). %H A245289 Jens Kruse Andersen, <a href="/A245289/b245289.txt">Table of n, a(n) for n = 1..10000</a> %F A245289 With b(m) = A005117(m), m >= 2, this is the sequence of the increasingly ordered members of the set {b(m): b(m) = (b(m-1)+ b(m+1))/2}. - _Wolfdieter Lang_, Jul 25 2014 %e A245289 2 is in this sequence because it is squarefree and the average of the previous squarefree number 1 and the following squarefree number 3. %t A245289 With[{sqfr=Select[Range[500],SquareFreeQ]},Transpose[Select[ Partition[ sqfr,3,1],(#[[1]]+#[[3]])/2==#[[2]]&]][[2]]] (* _Harvey P. Dale_, Dec 15 2014 *) %o A245289 (PARI) %o A245289 v = select(n->issquarefree(n), vector(300, n, n)); %o A245289 for(k=2, #v-1, if(2*v[k] == v[k-1]+v[k+1], print1(v[k], ", "))) \\ _Colin Barker_, Jul 17 2014 %Y A245289 Cf. A005117, A240475. %K A245289 nonn %O A245289 1,1 %A A245289 _Juri-Stepan Gerasimov_, Jul 16 2014