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 A126590 #21 Sep 08 2022 08:45:29
%S A126590 3,5,6,9,10,12,18,20,21,24,25,27,33,35,36,39,40,42,48,50,51,54,55,57,
%T A126590 63,65,66,69,70,72,78,80,81,84,85,87,93,95,96,99,100,102,108,110,111,
%U A126590 114,115,117,123,125,126,129,130,132,138,140,141,144,145,147,153,155,156
%N A126590 Multiples of 3 or 5 but not both.
%C A126590 Numbers n such that (n mod 3)*(n mod 5) = 0 and n mod 15 > 0.
%H A126590 Vincenzo Librandi, <a href="/A126590/b126590.txt">Table of n, a(n) for n = 1..1000</a>
%H A126590 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,1,-1).
%F A126590 a(n) = a(n-1) + a(n-6) - a(n-7). - _Charles R Greathouse IV_, Oct 11 2013
%e A126590 3, 5, 6, 9, 10, 12, (not 15), 18, 20, 21, 24, 25, 27, (not 30), 33, etc.
%t A126590 s={}; Do[m3=Mod[n,3]; m5=Mod[n,5]; m15=Mod[n,15]; If[m3*m5==0&&m15>0,AppendTo[s,n]],{n,200}]; s
%o A126590 (PARI) is(n)=isprime(gcd(n,15)) \\ _Charles R Greathouse IV_, Oct 11 2013
%o A126590 (Magma) I:=[3,5,6,9,10,12,18]; [n le 7 select I[n] else Self(n-1) + Self(n-6) - Self(n-7): n in [1..70]]; // _G. C. Greubel_, Mar 06 2018
%Y A126590 Cf. A126073, A126592.
%K A126590 nonn,easy
%O A126590 1,1
%A A126590 _Zak Seidov_, Mar 13 2007