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.

A062902 Number and its reversal are both multiples of 12.

This page as a plain text file.
%I A062902 #23 May 05 2025 03:00:46
%S A062902 0,48,84,216,252,276,408,420,444,468,480,612,636,672,696,804,828,840,
%T A062902 864,888,2100,2112,2124,2136,2148,2160,2172,2184,2196,2304,2316,2328,
%U A062902 2340,2352,2364,2376,2388,2508,2520,2532,2544,2556,2568,2580,2592,2700,2712
%N A062902 Number and its reversal are both multiples of 12.
%C A062902 Numbers divisible by 12 with reversal divisible by 4. - _Robert Israel_, May 04 2025
%H A062902 Robert Israel, <a href="/A062902/b062902.txt">Table of n, a(n) for n = 1..10000</a>
%e A062902 216 and 612 are both multiples of 12.
%p A062902 rev:= proc(n) local L,i;
%p A062902   L:= convert(n,base,10);
%p A062902   add(L[-i]*10^(i-1),i=1..nops(L))
%p A062902 end proc:
%p A062902 select(t -> rev(t) mod 12 = 0, [seq(i,i=0..3000,12)]); # _Robert Israel_, May 04 2025
%o A062902 (ARIBAS) n := 12; stop := 2800; m := 0; while m < stop do rev := int_reverse(m); if rev mod n = 0 then write(m," "); end; inc(m,n); end;
%Y A062902 Cf. A062897 (2), A062898 (4), A062899 (6), A062900 (8), A062901 (7), A062903 (13), A062904 (14), A062905 (15), A062906 (17), A062907 (19).
%Y A062902 Cf. A004086, A008594.
%K A062902 nonn,base,easy,look
%O A062902 1,2
%A A062902 _Amarnath Murthy_, Jul 01 2001
%E A062902 Corrected and extended by _Dean Hickerson_, Jul 06 2001
%E A062902 Offset changed by _Georg Fischer_, Sep 08 2022