login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184218 a(n) = largest k such that A000217(n+1) = A000217(n) + (A000217(n) mod k), or 0 if no such k exists. 2

%I #31 Sep 08 2022 08:45:55

%S 0,0,0,0,9,14,20,27,35,44,54,65,77,90,104,119,135,152,170,189,209,230,

%T 252,275,299,324,350,377,405,434,464,495,527,560,594,629,665,702,740,

%U 779,819,860,902,945,989,1034,1080,1127,1175,1224,1274,1325,1377

%N a(n) = largest k such that A000217(n+1) = A000217(n) + (A000217(n) mod k), or 0 if no such k exists.

%C From the definition, a(n) = A000217(n) - (n + 1) if A000217(n) - (n + 1) > (n + 1), or 0 otherwise, where A000217 are the triangular numbers.

%H G. C. Greubel and Vincenzo Librandi, <a href="/A184218/b184218.txt">Table of n, a(n) for n = 1..10000</a> [Originally computed by Remi Eismann]

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

%F a(n) = (n+1)*(n-2)/2 = A000096(n-2) for n >= 5 and a(n) = 0 for n <= 4. - _M. F. Hasler_, Jan 10 2011

%F From _Chai Wah Wu_, Jun 21 2016: (Start)

%F a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 7.

%F G.f.: x^5*(5*x^2 - 13*x + 9)/(1 - x)^3. (End)

%e For n = 3 we have A000217(3) = 6, A000217(4) = 10; there is no k such that 10 - 6 = 4 = (6 mod k), hence a(3) = 0.

%e For n = 5 we have A000217(5) = 15, A000217(6) = 21; 9 is the largest k such that 21 - 15 = 6 = (15 mod k), hence a(5) = 9; a(5) = A000217(5) - (5 + 1) = 15 - 6 = 9.

%e For n = 24 we have A000217(24) = 300, A000217(25) = 325; 275 is the largest k such that 325 - 300 = 25 = (300 mod k), hence a(24) = 275; a(24) = A000217(24) - (24 + 1) = 275.

%t Join[{0, 0, 0, 0}, LinearRecurrence[{3, -3, 1}, {9, 14, 20}, 100]] (* _G. C. Greubel_, Jun 22 2016 *)

%t lim = 10^4; Table[SelectFirst[Reverse@ Range@ lim, Function[k, PolygonalNumber[n + 1] == # + Mod[#, k] &@ PolygonalNumber@ n]], {n, 53}] /. {k_ /; MissingQ@ k -> 0, k_ /; k == lim -> 0} (* _Michael De Vlieger_, Jun 30 2016, Version 10.4 *)

%o (Magma) [0,0,0,0] cat [(n+1)*(n-2)/2: n in [5..60]]; // _Vincenzo Librandi_, Jun 22 2016

%Y Cf. essentially the same as A000096, A000217, A000027, A130703, A184219, A118534, A117078, A117563, A001223.

%K nonn,easy

%O 1,5

%A _RĂ©mi Eismann_, Jan 10 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)