cp's OEIS Frontend

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.

A380486 Numbers not congruent to {0, 1, 2, 3, 4, 5} mod 30.

This page as a plain text file.
%I A380486 #11 Feb 03 2025 19:56:02
%S A380486 6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,
%T A380486 36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,
%U A380486 59,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,96,97,98,99,100,101,102
%N A380486 Numbers not congruent to {0, 1, 2, 3, 4, 5} mod 30.
%C A380486 Numbers congruent to {6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29} mod 30.
%C A380486 Numbers k for which A276086(k) is a multiple of 5.
%H A380486 <a href="/index/Rec#order_25">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1).
%t A380486 Select[Range[0, 102], Mod[#, 30] > 5 &] (* _Amiram Eldar_, Feb 03 2025 *)
%o A380486 (PARI) is_A380486(n) = !!((n\6)%5);
%o A380486 (PARI) is_A380486(n) = ((n%30)>5);
%Y A380486 Cf. A276086, A380484, A380485 (complement).
%K A380486 nonn,easy,less
%O A380486 1,1
%A A380486 _Antti Karttunen_, Feb 03 2025