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 A236432 #29 Apr 13 2020 16:06:00
%S A236432 210,630,1050,1470,1890,2310,2730,3150,3570,3990,4410,4830,5250,5670,
%T A236432 6090,6510,6930,7350,7770,8190,8610,9030,9450,9870,10290,10710,11130,
%U A236432 11550,11970,12390,12810,13230,13650,14070,14490,14910,15330,15750,16170,16590,17010
%N A236432 a(n) = (2n-1)*210; numbers which are 210 times an odd number.
%C A236432 This is a subsequence of A235921, from which it differs for the first time at n = 1062348, where a(n) = ((2*1062348)-1)*210 = 446185950, while A235921(n) = 446185740.
%H A236432 Antti Karttunen, <a href="/A236432/b236432.txt">Table of n, a(n) for n = 1..10001</a>
%H A236432 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%H A236432 <a href="/index/Se#sequences_which_agree_for_a_long_time">Index entries for sequences which agree for a long time but are different</a>
%F A236432 a(n) = (2n-1) * 210 = 420*n - 210.
%F A236432 For all n, A236454(a(n)) = 8, while A053669(a(n)) >= 11. [Cf. comments at A235921]
%p A236432 A236432:=n->420*n - 210; seq(A236432(n), n=1..50); # _Wesley Ivan Hurt_, Mar 13 2014
%t A236432 Table[420 n - 210, {n, 50}] (* _Wesley Ivan Hurt_, Mar 13 2014 *)
%t A236432 LinearRecurrence[{2,-1},{210,630},41] (* _Ray Chandler_, Jul 14 2015 *)
%t A236432 210*Range[1,81,2] (* _Harvey P. Dale_, Apr 13 2020 *)
%o A236432 (Scheme, two alternative versions)
%o A236432 (define (A236432 n) (* (+ n n -1) 210))
%o A236432 (define (A236432 n) (- (* 420 n) 210))
%Y A236432 Cf. A235921.
%K A236432 nonn,easy
%O A236432 1,1
%A A236432 _Antti Karttunen_, Jan 25 2014