A010764 a(n) = floor(n/2) mod floor(n/3).

0, 0, 0, 1, 1, 0, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 9, 10, 9, 10, 10, 10, 10, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 12, 12, 13, 12, 13, 13, 13, 13, 14, 13, 14, 14, 14, 14, 15, 14, 15, 15

Offset: 3

Author

N. J. A. Sloane, Simon Plouffe

Keywords

• nonn
• easy

Examples

			G.f. = x^6 + x^7 + x^9 + 2*x^10 + 2*x^11 + 2*x^12 + 2*x^13 + 3*x^14 + ...
		

Links

• Antti Karttunen, Table of n, a(n) for n = 3..10000

Crossrefs

Cf. A002264, A004526, A008615.

Programs

Maple

[ seq(floor(n/2) mod floor(n/3), n=3..100) ];

Mathematica

Table[Mod[Floor[n/2],Floor[n/3]],{n,3,100}] (* Harvey P. Dale, Apr 06 2018 *)

PARI

{a(n) = if( n<3, 0, (n\2) % (n\3))}; /* Michael Somos, Feb 06 2003 */

Formula

G.f.: x^6*(1 + x - x^2 - x^3 + x^4 + 2*x^5 - 2*x^7)/((1 - x^2)*(1 - x^3)).

a(n) = A008615(n) if n>8. - Michael Somos, Feb 06 2003

a(n) = A004526(n) mod A002264(n). - Antti Karttunen, Aug 23 2017