login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = floor(n/11).
2

%I #13 Aug 03 2021 11:43:35

%S 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,3,

%T 3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,6,6,

%U 6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8

%N a(n) = floor(n/11).

%C Terms agree with A064458 for all n < 121, but a(121) = 11 while A064458(121) = 12.

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

%F From _Chai Wah Wu_, May 18 2021: (Start)

%F a(n) = a(n-1) + a(n-11) - a(n-12) for n > 11.

%F G.f.: x^11/(x^12 - x^11 - x + 1). (End)

%t Floor[Range[0, 100]/11]

%t CoefficientList[Series[x^11/(x^12-x^11-x+1),{x,0,100}],x] (* or *) LinearRecurrence[{1,0,0,0,0,0,0,0,0,0,1,-1},{0,0,0,0,0,0,0,0,0,0,0,1},100] (* _Harvey P. Dale_, Aug 03 2021 *)

%Y Cf. A064458, A059995 (floor n/10).

%K nonn,easy

%O 0,23

%A _Wesley Ivan Hurt_, May 17 2021