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!)
A239831 Floor(7n^2/2) + floor(5n/2) + floor(3n/7). 1

%I #23 Sep 08 2022 08:46:07

%S 5,19,39,67,101,143,191,247,308,379,454,539,628,727,830,942,1060,1186,

%T 1318,1458,1604,1758,1917,2086,2259,2442,2629,2826,3027,3237,3453,

%U 3677,3907,4145,4389,4641,4898,5165,5436,5717,6002,6297,6596,6904,7218,7540

%N Floor(7n^2/2) + floor(5n/2) + floor(3n/7).

%C This is a quadratic sequence.

%H Vincenzo Librandi, <a href="/A239831/b239831.txt">Table of n, a(n) for n = 1..1000</a>

%H Wolfram Alpha, <a href="https://www.wolframalpha.com/share/clip?f=d41d8cd98f00b204e9800998ecf8427e8mn5b969d6">Table of floor(7n^2/2) + floor(5n/2) + floor(3n/7)</a>.

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

%F a(n) = (n(7n + 5) + (-1)^n - 1)/2 + A132270(3n + 1). [_Bruno Berselli_, Mar 28 2014]

%F a(n) = +a(n-1) +a(n-2) -a(n-3) +a(n-7) -a(n-8) -a(n-9) +a(n-10). [_Bruno Berselli_, Mar 28 2014]

%e For n=3, a(3) = floor(7*3^2/2) + floor(5*3/2) + floor(3*3/7) = 39.

%p A239831:=n->floor(7*n^2/2) + floor(5*n/2) + floor(3*n/7); seq(A239831(n), n=1..50); # _Wesley Ivan Hurt_, Mar 28 2014

%t Table[Floor[7 n^2/2] + Floor[5 n/2] + Floor[3 n/7], {n, 50}] (* _Bruno Berselli_, Mar 28 2014 *)

%o (Magma) [Floor(7*n^2/2) + Floor(5*n/2) + Floor(3*n/7): n in [1..50]]; // _Vincenzo Librandi_, Mar 29 2014

%K nonn,easy

%O 1,1

%A _Katherine Guo_, Mar 27 2014

%E More terms from _Bruno Berselli_, Mar 28 2014

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 26 04:36 EDT 2024. Contains 371989 sequences. (Running on oeis4.)