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 A380485 #15 Feb 03 2025 19:56:09
%S A380485 0,1,2,3,4,5,30,31,32,33,34,35,60,61,62,63,64,65,90,91,92,93,94,95,
%T A380485 120,121,122,123,124,125,150,151,152,153,154,155,180,181,182,183,184,
%U A380485 185,210,211,212,213,214,215,240,241,242,243,244,245,270,271,272,273,274,275,300,301,302,303,304,305,330,331,332,333
%N A380485 Numbers congruent to {0, 1, 2, 3, 4, 5} mod 30.
%C A380485 Numbers k for which A276086(k) is not a multiple of 5.
%C A380485 Odd bisection gives numbers that are congruent to {0, 2, 4} mod 30, thus when halved, congruent to {0, 1, 2} mod 15, thus terms of A267711, numbers k such that k mod 3 = k mod 5.
%H A380485 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,1,-1).
%F A380485 a(2*n-1) = 2*A267711(n).
%t A380485 Select[Range[0, 333], Mod[#, 30] < 6 &] (* _Amiram Eldar_, Feb 03 2025 *)
%o A380485 (PARI) is_A380485(n) = !((n\6)%5);
%o A380485 (PARI) is_A380485(n) = ((n%30)<6);
%Y A380485 Cf. A276086, A380484 (characteristic function), A380486 (complement).
%Y A380485 Cf. also A267711 (odd bisection halved).
%K A380485 nonn,easy
%O A380485 1,3
%A A380485 _Antti Karttunen_, Feb 03 2025