login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010761 a(n) = floor(n/2) + floor(n/3). 10

%I

%S 0,1,2,3,3,5,5,6,7,8,8,10,10,11,12,13,13,15,15,16,17,18,18,20,20,21,

%T 22,23,23,25,25,26,27,28,28,30,30,31,32,33,33,35,35,36,37,38,38,40,40,

%U 41,42,43,43,45,45,46,47,48,48,50,50,51,52,53,53,55,55,56,57,58,58,60,60

%N a(n) = floor(n/2) + floor(n/3).

%C a(n) = A004526(n) + A002264(n). - _Reinhard Zumkeller_, Jul 25 2005

%H Vincenzo Librandi, <a href="/A010761/b010761.txt">Table of n, a(n) for n = 1..2000</a>

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

%F G.f.: x^2*(1+2*x+2*x^2)/((1-x^2)*(1-x^3)). a(-n) = -2-a(n-1). - _Michael Somos_, Aug 07 2005

%p seq(floor(n/2) + floor(n/3), n=1..64);

%t Table[Floor[n/2] + Floor[n/3], {n, 100}] (* _Wesley Ivan Hurt_, Feb 21 2014 *)

%t LinearRecurrence[{0,1,1,0,-1},{0,1,2,3,3},80] (* _Harvey P. Dale_, May 05 2018 *)

%o (PARI) a(n)=n\2+n\3

%o (MAGMA) [Floor (n/2)+Floor(n/3): n in [0..100]]; // _Vincenzo Librandi_, Feb 22 2014

%Y Cf. A010762, A110532.

%K nonn,easy

%O 1,3

%A _Simon Plouffe_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 14 15:18 EDT 2021. Contains 342949 sequences. (Running on oeis4.)