This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236432 a(n) = (2n-1)*210; numbers which are 210 times an odd number. 2

%I

%S 210,630,1050,1470,1890,2310,2730,3150,3570,3990,4410,4830,5250,5670,

%T 6090,6510,6930,7350,7770,8190,8610,9030,9450,9870,10290,10710,11130,

%U 11550,11970,12390,12810,13230,13650,14070,14490,14910,15330,15750,16170,16590,17010

%N a(n) = (2n-1)*210; numbers which are 210 times an odd number.

%C 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 Antti Karttunen, <a href="/A236432/b236432.txt">Table of n, a(n) for n = 1..10001</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%H <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 a(n) = (2n-1) * 210 = 420*n - 210.

%F For all n, A236454(a(n)) = 8, while A053669(a(n)) >= 11. [Cf. comments at A235921]

%p A236432:=n->420*n - 210; seq(A236432(n), n=1..50); # _Wesley Ivan Hurt_, Mar 13 2014

%t Table[420 n - 210, {n, 50}] (* _Wesley Ivan Hurt_, Mar 13 2014 *)

%t LinearRecurrence[{2,-1},{210,630},41] (* _Ray Chandler_, Jul 14 2015 *)

%o (Scheme, two alternative versions)

%o (define (A236432 n) (* (+ n n -1) 210))

%o (define (A236432 n) (- (* 420 n) 210))

%Y Cf. A235921.

%K nonn,easy

%O 1,1

%A _Antti Karttunen_, Jan 25 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)