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 A060469 #17 Mar 12 2025 08:19:45
%S A060469 1,2,3,4,6,8,11,13,16,18,23,25,28,30,35,37,40,42,47,49,52,54,59,61,64,
%T A060469 66,71,73,76,78,83,85,88,90,95,97,100,102,107,109,112,114,119,121,124,
%U A060469 126,131,133,136,138,143,145,148,150,155,157,160,162,167,169,172,174
%N A060469 Smallest positive a(n) such that number of solutions to a(n) = a(j)+a(k) j<k<n is one or less.
%C A060469 Numbers {1,4,6,11} mod 12 plus {2,3,8}.
%H A060469 Colin Barker, <a href="/A060469/b060469.txt">Table of n, a(n) for n = 1..1000</a>
%H A060469 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A060469 a(n) = a(n-1)+a(n-4)-a(n-5) for n>9. - _Colin Barker_, Feb 27 2015
%F A060469 G.f.: x*(2*x^10+x^8+x^7+2*x^6+x^5+x^4+x^3+x^2+x+1) / ((x-1)^2*(x+1)*(x^2+1)). - _Colin Barker_, Feb 27 2015
%F A060469 a(n) = (6*n - 22 - (-1)^n + A056594(n) - A056594(n+1))/2 for n > 6. - _Stefano Spezia_, Mar 11 2025
%e A060469 11 is in the sequence since it is 3+8 but no other sum of two distinct terms.
%t A060469 LinearRecurrence[{1, 0, 0, 1, -1}, {1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 23}, 100] (* _Paolo Xausa_, Mar 04 2024 *)
%o A060469 (PARI) Vec(x*(2*x^10+x^8+x^7+2*x^6+x^5+x^4+x^3+x^2+x+1)/((x-1)^2*(x+1)*(x^2+1)) + O(x^100)) \\ _Colin Barker_, Feb 27 2015
%Y A060469 Cf. A002858, A033627, A056594, A060469, A060470, A060471, A060472.
%Y A060469 Virtually identical to A003662.
%K A060469 nonn,easy
%O A060469 1,2
%A A060469 _Henry Bottomley_, Mar 15 2001