A002529 -id:A002529 - cp's OEIS frontend

A079978 Characteristic function of multiples of three.

1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0

Offset: 0

Vladimir Baltic, Feb 17 2003

Period 3: repeat [1, 0, 0].
a(n)=1 if n=3k, a(n)=0 otherwise.
Decimal expansion of 1/999.
Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=2, I={0,1}.
a(n) is also the number of partitions of n with every part being three (a(0)=1 because the empty partition has no parts). Hence a(n) is also the number of 2-regular graphs on n vertices with each component having girth 3. - Jason Kimberley, Oct 02 2011
Euler transformation of A185013. - Jason Kimberley, Oct 02 2011
If b(0)=0 and for n > 0, b(n)=a(n), then starting at n=0, b(n) is the number of incongruent equilateral triangles formed from the vertices of a regular n-gon. The number of incongruent isosceles triangles (strictly two equal sides) is A174257(n) and the number of incongruent scalene triangles is A069905(n-3) for n > 2, otherwise 0. The total number of incongruent triangles is A069905(n). - Frank M Jackson, Nov 19 2022

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135.
N. Gogin and A. Mylläri, Padovan-like sequences and Bell polynomials, Proceedings of Applications of Computer Algebra ACA, 2013.
Clark Kimberling, A Combinatorial Classification of Triangle Centers on the Line at Infinity, J. Int. Seq., Vol. 22 (2019), Article 19.5.4.
Index entries for characteristic functions
Index entries for linear recurrences with constant coefficients, signature (0,0,1).

Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
Essentially the same as A022003.
Partial sums are given by A002264(n+3).
Characteristic function of multiples of g: A000007 (g=0), A000012 (g=1), A059841 (g=2), this sequence (g=3), A121262 (g=4), A079998 (g=5), A079979 (g=6), A082784 (g=7). - Jason Kimberley, Oct 14 2011
Cf. A007908, A011655 (bit flipped).

a079978 = fromEnum . (== 0) . (`mod` 3)
a079978_list = cycle [1,0,0]
-- Reinhard Zumkeller, Aug 28 2012, Nov 26 2011

&cat[[1,0,0]^^30]; // Vincenzo Librandi, Dec 26 2015

seq(op([1, 0, 0]), n=0..50); # Wesley Ivan Hurt, Jun 30 2016

Table[Boole[IntegerQ[n/3]], {n, 0, 127}] (* Michael De Vlieger, Jan 03 2015, after Alonso del Arte at A121262 *)

a(n)=!(n%3) \\ Jaume Oliver Lafont, Mar 01 2009

a(n) = a(n-3) for n > 2.
G.f.: 1/(1-x^3) = 1/( (1-x)*(1+x+x^2)).
a(n) = (1 + e^(i*Pi*A002487(n)))/2, i=sqrt(-1). - Paul Barry, Jan 14 2005
Additive with a(p^e) = 1 if p = 3, 0 otherwise.
a(n) = ((n+1) mod 3) mod 2. Also: a(n) = (1/2)*(1 + (-1)^(n + floor((n+1)/3))). - Hieronymus Fischer, May 29 2007
a(n) = 1 - A011655(n). - Reinhard Zumkeller, Nov 30 2009
a(n) = (1 + (-1)^(2*n/3) + (-1)^(-2*n/3))/3. - Jaume Oliver Lafont, May 13 2010
For the general case: the characteristic function of numbers that are multiples of m is a(n) = floor(n/m) - floor((n-1)/m), m,n > 0. - Boris Putievskiy, May 08 2013
a(n) = floor( ((n-1) mod 3)/2 ). - Wesley Ivan Hurt, Jun 29 2013
a(n) = 2^(n mod 3) mod 2. - Olivier Gérard, Jul 04 2013
a(n) = (w^(2*n) + w^n + 1)/3, w = (-1 + i*sqrt(3))/2 (w is a primitive 3rd root of unity). - Bogart B. Strauss, Jul 20 2013
E.g.f.: (exp(x) + 2*exp(-x/2)*cos(sqrt(3)*x/2))/3. - Geoffrey Critzer, Nov 03 2014
a(n) = (sin(Pi*(n+1)/3)^2)*(2/3) + sin(Pi*(n+1)*2/3)/sqrt(3). - Mikael Aaltonen, Jan 03 2015
a(n) = (2*n^2 + 1) mod 3. The characteristic function of numbers that are multiples of 2k+1 is (2*k*n^(2*k) + 1) mod (2k+1). Example: A058331(n) mod 3 for k=1, A211412(n) mod 5 for k=2, ... - Eric Desbiaux, Dec 25 2015
a(n) = floor(2*(n-1)/3) - 2*floor((n-1)/3). - Wesley Ivan Hurt, Jul 25 2016
a(n) == A007908(n+1) (mod 3), n >= 0. See A011655 (bit flipped). - Wolfdieter Lang, Jun 12 2017
a(n) = 1/3 + (2/3)*cos((2/3)*n*Pi). - Ridouane Oudra, Jan 22 2021
a(n) = A000217(n+1) mod 3. - Christopher Adams, Jan 05 2025

Name simplified by Ralf Stephan, Nov 22 2010

Name changed by Jason Kimberley, Oct 14 2011

A072856 Number of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4).

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 504, 1902, 6902, 25231, 95401, 365116, 1396948, 5316192, 20135712, 76227216, 288878956, 1095937420, 4159450913, 15783649241, 59878012558, 227128287882, 861543171080, 3268198646496, 12398132725784, 47033439463906, 178423731589482

Offset: 0

Vladimir Baltic, Jul 25 2002

a(n) equals the permanent of the n X n matrix with 1's along the nine central diagonals and 0's everywhere else. - John M. Campbell, Jul 09 2011

R. H. Hardin, Table of n, a(n) for n = 0..400 (corrected by _R. H. Hardin_, Jan 19 2019)
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (April, 2010), 119-135
Torleiv Kløve, Spheres of Permutations under the Infinity Norm - Permutations with limited displacement. Reports in Informatics, Department of Informatics, University of Bergen, Norway, no. 376, November 2008.
Index entries for linear recurrences with constant coefficients, signature (3, 2, -1, -1, 70, 39, -31, -114, -522, -184, 34, 46, 1444, 202, -606, 1204, 198, -804, 542, -26, -2372, -318, 1582, -328, -2018, -222, 810, 184, -706, -14, 204, 70, 14, 28, -22, -11, 47, -8, -11, -1, -4, 1, 1).

Cf. A002524..A002529, A072827, A072850..A072856, A079955..A080014.

Column k=4 of A306209.

G.f.: (1 -2*x -3*x^2 -x^3 +4*x^4 -31*x^5 -5*x^6 +32*x^7 -21*x^8 +129*x^9 +94*x^10 -83*x^11 +11*x^12 -192*x^13 -59*x^14 +63*x^15 -16*x^16 +3*x^17 -29*x^18 -46*x^19 -57*x^20 +253*x^21 -28*x^22 -101*x^23 +17*x^24 +104*x^25 -15*x^26 -29*x^27 +10*x^28 -x^29 +x^30 -x^32 -3*x^33 +x^35) / (1 -3*x -2*x^2 +x^3 +x^4 -70*x^5 -39*x^6 +31*x^7 +114*x^8 +522*x^9 +184*x^10 -34*x^11 -46*x^12 -1444*x^13 -202*x^14 +606*x^15 -1204*x^16 -198*x^17 +804*x^18 -542*x^19 +26*x^20 +2372*x^21 +318*x^22 -1582*x^23 +328*x^24 +2018*x^25 +222*x^26 -810*x^27 -184*x^28 +706*x^29 +14*x^30 -204*x^31 -70*x^32 -14*x^33 -28*x^34 +22*x^35 +11*x^36 -47*x^37 +8*x^38 +11*x^39 +x^40 +4*x^41 -x^42 -x^43). - Torleiv Kløve, Jan 13 2009; corrected by Colin Barker, Jul 06 2013

a(0)=1 prepended and more terms added by Colin Barker, Jul 06 2013

A072827 Number of permutations satisfying i-2<=p(i)<=i+3, i=1..n.

Original entry on oeis.org

1, 2, 6, 18, 46, 115, 301, 792, 2068, 5380, 14020, 36581, 95413, 248786, 648714, 1691686, 4411530, 11503991, 29998953, 78228640, 203998184, 531969064, 1387222648, 3617479225, 9433351129, 24599481138, 64148406350, 167280683834

Offset: 1

Vladimir Baltic, Jul 21 2002

R. H. Hardin, Table of n, a(n) for n = 1..400
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (April, 2010), 119-135.
Index entries for linear recurrences with constant coefficients, signature (1,2,3,5,6,-1,-1,0,-1,-1).

Cf. A002524, A002525, A002526, A002527, A002528, A002529, A072850, A072851, A072852, A072853, A072854, A072855, A072856, A079955-A080014.

LinearRecurrence[{1,2,3,5,6,-1,-1,0,-1,-1},{1,2,6,18,46,115,301,792,2068,5380},30] (* Harvey P. Dale, Aug 15 2014 *)

a(n)=([0,1,0,0,0,0,0,0,0,0; 0,0,1,0,0,0,0,0,0,0; 0,0,0,1,0,0,0,0,0,0; 0,0,0,0,1,0,0,0,0,0; 0,0,0,0,0,1,0,0,0,0; 0,0,0,0,0,0,1,0,0,0; 0,0,0,0,0,0,0,1,0,0; 0,0,0,0,0,0,0,0,1,0; 0,0,0,0,0,0,0,0,0,1; -1,-1,0,-1,-1,6,5,3,2,1]^(n-1)*[1;2;6;18;46;115;301;792;2068;5380])[1,1] \\ Charles R Greathouse IV, Jul 28 2015

Recurrence: a(n) = a(n-1)+2*a(n-2)+3*a(n-3)+5*a(n-4)+6*a(n-5)-a(n-6)-a(n-7)-a(n-9)-a(n-10).

G.f.: (1-x^5-x^3-x^2)/(x^10+x^9+x^7+x^6-6*x^5-5*x^4-3*x^3-2*x^2-x+1). [Corrected by Georg Fischer, May 15 2019]

A072850 Number of permutations satisfying i-2<=p(i)<=i+4, i=1..n.

Original entry on oeis.org

1, 2, 6, 18, 54, 146, 391, 1081, 3004, 8320, 22984, 63424, 175176, 484113, 1337721, 3695886, 10210702, 28209954, 77940078, 215337554, 594943087, 1643728129, 4541349672, 12547013504, 34665373744, 95774808224, 264610227072

Offset: 1

Vladimir Baltic, Jul 25 2002

R. H. Hardin, Table of n, a(n) for n=1..400
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (April, 2010), 119-135
Index entries for linear recurrences with constant coefficients, signature (1, 2, 4, 6, 10, 12, -4, -6, -6, 0, -2, -2, 0, 1, 1).

Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.

Recurrence: a(n) = a(n - 1) + 2*a(n - 2) + 4*a(n - 3) + 6*a(n - 4) + 10*a(n - 5) + 12*a(n - 6) - 4*a(n - 7) - 6*a(n - 8) - 6*a(n - 9) - 2*a(n - 11) - 2*a(n - 12) + a(n - 14) + a(n - 15).

G.f.: - (x^9 + x^7 - 2*x^6 - 2*x^4 - 2*x^3 - x^2 + 1)/(x^15 + x^14 - 2*x^12 - 2*x^11 - 6*x^9 - 6*x^8 - 4*x^7 + 12*x^6 + 10*x^5 + 6*x^4 + 4*x^3 + 2*x^2 + x - 1)

A080014 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={1}.

Original entry on oeis.org

1, 1, 1, 3, 6, 10, 18, 35, 65, 119, 221, 412, 764, 1416, 2629, 4881, 9057, 16807, 31194, 57894, 107442, 199399, 370065, 686799, 1274617, 2365544, 4390184, 8147680, 15121161, 28063153, 52082017, 96658283, 179386750, 332921362, 617864098

Offset: 0

Vladimir Baltic, Jan 24 2003

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,-1,-1).

Cf. A002524-A002529, A072827, A072850..A072856, A079955..A080014.

LinearRecurrence[{1,1,1,1,-1,-1},{1,1,1,3,6,10},40] (* Harvey P. Dale, Mar 10 2024 *)

Vec(-(x^2-1)/(x^6+x^5-x^4-x^3-x^2-x+1)+O(x^99)) \\ Charles R Greathouse IV, Jun 12 2015

Recurrence: a(n) = a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6).

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

A079955 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 2, 2, 3, 3, 5, 6, 9, 11, 15, 19, 26, 34, 46, 60, 80, 105, 140, 185, 246, 325, 431, 570, 756, 1001, 1327, 1757, 2328, 3083, 4085, 5411, 7169, 9496, 12580, 16664, 22076, 29244, 38741, 51320, 67985, 90060, 119305, 158045, 209366, 277350, 367411

Offset: 0

Vladimir Baltic, Feb 19 2003

Number of compositions (ordered partitions) of n into elements of the set {2,5,6}.

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135
Index entries for linear recurrences with constant coefficients, signature (0,1,0,0,1,1).

Cf. A002524, A002525, A002526, A002527, A002528, A002529, A072827.
Cf. A072850, A072851, A072852, A072853, A072854, A072855, A072856.
Cf. A079955 - A080014.

R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( 1/(1-x^2-x^5-x^6) )); // G. C. Greubel, Dec 11 2019

seq(coeff(series(1/(1-x^2-x^5-x^6), x, n+1), x, n), n = 0..50); # G. C. Greubel, Dec 11 2019

LinearRecurrence[{0, 1, 0, 0, 1, 1}, {1, 0, 1, 0, 1, 1}, 51] (* Jean-François Alcover, Dec 11 2019 *)

a(n) = ([0,1,0,0,0,0; 0,0,1,0,0,0; 0,0,0,1,0,0; 0,0,0,0,1,0; 0,0,0,0,0,1; 1,1,0,0,1,0]^n*[1;0;1;0;1;1])[1,1] \\ Charles R Greathouse IV, Jul 28 2015

def A079955_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( 1/(1-x^2-x^5-x^6) ).list()
A079955_list(50) # G. C. Greubel, Dec 11 2019

a(n) = a(n-2) + a(n-5) + a(n-6).

G.f.: 1/(1 - x^2 - x^5 - x^6).

A079998 The characteristic function of the multiples of five.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1

Offset: 0

Vladimir Baltic, Feb 10 2003

Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i = 1..n, with k = 2, r = 3, I = {-1, 0, 1, 2}.
a(n) = 1 if n = 5k, a(n) = 0 otherwise. Also, number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i = 1..n, with k = 1, r = 4, I = {0, 1, 2, 3}.
a(n) is also the number of partitions of n with each part being five (a(0) = 1 because the empty partition has no parts to test equality with five). Hence a(n) is also the number of 2-regular graphs on n vertices with each component having girth exactly five. - Jason Kimberley, Oct 02 2011
This sequence is the Euler transformation of A185015. - Jason Kimberley, Oct 02 2011

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

Antti Karttunen, Table of n, a(n) for n = 0..16385
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (April, 2010), 119-135.
Benoit Cloitre, A study of a family of self-referential sequences, arXiv:2506.18103 [math.GM], 2025. See p. 10.
Index entries for characteristic functions
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1).

Cf. A011558, A008587, A002524-A002529, A072827, A072850-A072856, A079955-A080014.

Characteristic function of multiples of g: A000007 (g = 0), A000012 (g = 1), A059841 (g = 2), A079978 (g = 3), A121262 (g = 4), this sequence (g = 5), A079979 (g = 6), A082784 (g = 7). - Jason Kimberley, Oct 14 2011

[Binomial(n-1,4) mod 5 : n in [0..100]]; // Wesley Ivan Hurt, Oct 06 2014

A079998:=n->binomial(n-1,4) mod 5: seq(A079998(n), n=0..100); # Wesley Ivan Hurt, Oct 06 2014

Table[Mod[Binomial[n - 1, 4], 5], {n, 0, 100}] (* Wesley Ivan Hurt, Oct 06 2014 *)
Table[Boole[Divisible[n, 5]], {n, 0, 99}] (* Alonso del Arte, Nov 29 2014 *)
PadRight[{},120,{1,0,0,0,0}] (* Harvey P. Dale, Jul 11 2023 *)

a(n)=!(n%5) \\ Charles R Greathouse IV, Mar 07 2012

(define (A079998 n) (if (zero? (modulo n 5)) 1 0)) ;; Antti Karttunen, Dec 21 2017

Recurrence: a(n) = a(n-5). G.f.: -1/(x^5 - 1).
a(n) = 1 - A011558(n); a(A008587(n)) = 1; a(A047201(n)) = 0. - Reinhard Zumkeller, Nov 30 2009
a(n) = floor(1/2*cos(2*n*Pi/5) + 1/2). - Gary Detlefs, May 16 2011
a(n) = floor(n/5) - floor((n-1)/5). - Tani Akinari, Oct 21 2012
a(n) = binomial(n - 1, 4) mod 5. - Wesley Ivan Hurt, Oct 06 2014

More terms from Antti Karttunen, Dec 21 2017

A002526 Number of permutations of length n within distance 3 of a fixed permutation.

Original entry on oeis.org

1, 1, 2, 6, 24, 78, 230, 675, 2069, 6404, 19708, 60216, 183988, 563172, 1725349, 5284109, 16177694, 49526506, 151635752, 464286962, 1421566698, 4352505527, 13326304313, 40802053896, 124926806216, 382497958000, 1171122069784, 3585709284968, 10978628154457

Offset: 0

N. J. A. Sloane

For positive n, a(n) equals the permanent of the n X n matrix with 1's along the seven central diagonals, and 0's everywhere else. - John M. Campbell, Jul 09 2011

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. H. Hardin, Table of n, a(n) for n=0..400, Jul 11 2010
V. Baltic, On the number of certain types of strongly restricted permutations, Appl. An. Disc. Math. 4 (2010), 119-135; DOI:10.2298/AADM1000008B.
Torleiv Kløve, Spheres of Permutations under the Infinity Norm - Permutations with limited displacement, Reports in Informatics, Department of Informatics, University of Bergen, Norway, no. 376, November 2008. (Table 3, top row).
O. Krafft and M. Schaefer, On the number of permutations within a given distance, Fib. Quart. 40 (5) (2002) 429-434.
R. Lagrange, Quelques résultats dans la métrique des permutations, Annales Scientifiques de l'École Normale Supérieure, Paris, 79 (1962), 199-241.
Index entries for linear recurrences with constant coefficients, signature (2,2,0,10,8,-2,-16,-10,-2,4,2,0,2,1).

The 14 sequences in Kløve's Table 3 are A002526, A002527, A002529, A188379, A188491, A188492, A188493, A188494, A002528, A188495, A188496, A188497, A188498, A002526.
Cf. A002524.
Column k=3 of A306209.

R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (1-x-2*x^2-2*x^4+x^7+x^8)/(1-2*x-2*x^2-10*x^4-8*x^5+2*x^6+16*x^7+10*x^8 +2*x^9-4*x^10-2*x^11-2*x^13-x^14) )); // G. C. Greubel, Jan 22 2022

CoefficientList[Series[(1-x-2x^2-2x^4+x^7+x^8)/(1-2x-2x^2-10x^4-8x^5+ 2x^6+ 16x^7+10x^8+2x^9-4x^10-2x^11-2x^13-x^14),{x,0,50}],x] (* or *) LinearRecurrence[{2,2,0,10,8,-2,-16,-10,-2,4,2,0,2,1},{1,1,2,6,24,78, 230, 675,2069,6404,19708,60216,183988,563172},51] (* Harvey P. Dale, Jun 22 2011 *)

Vec((1-x-2*x^2-2*x^4+x^7+x^8)/(1-2*x-2*x^2-10*x^4-8*x^5+2*x^6+16*x^7+10*x^8+2*x^9-4*x^10-2*x^11-2*x^13-x^14)+O(x^99)) \\ Charles R Greathouse IV, Jul 16 2011

[( (1-x-2*x^2-2*x^4+x^7+x^8)/(1-2*x-2*x^2-10*x^4-8*x^5+2*x^6+16*x^7+10*x^8 +2*x^9-4*x^10-2*x^11-2*x^13-x^14) ).series(x,n+1).list()[n] for n in (0..40)] # G. C. Greubel, Jan 22 2022

G.f.: (1-x-2*x^2-2*x^4+x^7+x^8)/(1-2*x-2*x^2-10*x^4-8*x^5+2*x^6+16*x^7+10*x^8 +2*x^9-4*x^10-2*x^11-2*x^13-x^14).

a(0)=1, a(1)=1, a(2)=2, a(3)=6, a(4)=24, a(5)=78, a(6)=230, a(7)=675, a(8)=2069, a(9)=6404, a(10)=19708, a(11)=60216, a(12)=183988, a(13)=563172, a(n) = 2*a(n-1) +2*a(n-2) +10*a(n-4) +8*a(n-5) -2*a(n-6) -16*a(n-7) -10*a(n-8) -2*a(n-9) +4*a(n-10) +2*a(n-11) +2*a(n-13) +a(n-14). - Harvey P. Dale, Jun 22 2011

A079979 Characteristic function of multiples of six.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1

Offset: 0

Vladimir Baltic, Feb 17 2003

Period 6: repeat [1, 0, 0, 0, 0, 0].
a(n)=1 if n=6k, a(n)=0 otherwise.
Decimal expansion of 1/999999.
Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-2,-1,0,1,2}.
Also, number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,2,3,4}.
a(n) is also the number of partitions of n such that each part is six (a(0)=1 because the empty partition has no parts to test equality with six). Hence a(n) is also the number of 2-regular graphs on n vertices with each part having girth exactly six. - Jason Kimberley, Oct 10 2011
This sequence is the Euler transformation of A185016. - Jason Kimberley, Oct 10 2011

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

Antti Karttunen, Table of n, a(n) for n = 0..65538
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (April, 2010), 119-135
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1).
Index entries for characteristic functions

Cf. A002524-A002529, A010875, A072827, A072850-A072856, A079955-A080014, A097325, A122841.

Characteristic function of multiples of g: A000007 (g=0), A000012 (g=1), A059841 (g=2), A079978 (g=3), A121262 (g=4), A079998 (g=5), this sequence (g=6), A082784 (g=7).

Magma
```
&cat[[1,0^^5]^^30];
```

A079979 := func; [A079979:n in [0..59]];  // Jason Kimberley, Oct 10 2011

PadRight[{},120,{1,0,0,0,0,0}] (* Harvey P. Dale, Feb 19 2013 *)

a(n)=!(n%6) \\ Charles R Greathouse IV, Oct 10 2011

(define (A079979 n) (if (zero? (modulo n 6)) 1 0)) ;; Antti Karttunen, Dec 22 2017

a(n) = a(n-6).
G.f.: 1/(1-x^6).
a(n) = floor((1/2)*cos(n*Pi/3) + 1/2). - Gary Detlefs, May 16 2011
a(n) = floor(n/6) - floor((n-1)/6). - Tani Akinari, Oct 23 2012
a(n) = (((((v^n - w^n)^2)*(2 - (-1)^n)*(w^(2*n) + w^n - 3))^2 - 144)^2)/20736, where w = (-1+i*sqrt(3))/2, v = (1+i*sqrt(3))/2. - Bogart B. Strauss, Sep 20 2013
E.g.f.: (2*cos(sqrt(3)*x/2)*cosh(x/2) + cosh(x))/3. - Vaclav Kotesovec, Feb 15 2015

More terms from Antti Karttunen, Dec 22 2017

A079977 Fibonacci numbers interspersed with zeros.

Original entry on oeis.org

1, 0, 1, 0, 2, 0, 3, 0, 5, 0, 8, 0, 13, 0, 21, 0, 34, 0, 55, 0, 89, 0, 144, 0, 233, 0, 377, 0, 610, 0, 987, 0, 1597, 0, 2584, 0, 4181, 0, 6765, 0, 10946, 0, 17711, 0, 28657, 0, 46368, 0, 75025, 0, 121393, 0, 196418, 0, 317811, 0, 514229, 0, 832040, 0, 1346269

Offset: 0

Vladimir Baltic, Feb 17 2003

Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=3, I={0,2}.
Number of compositions of n into elements of the set {2,4}.
a(n-2) is the number of circular arrangements of the first n positive integers such that adjacent terms have absolute difference 1 or 3. - Ethan Patrick White, Jun 24 2020

D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics 4 (2010), 119-135.
Ethan P. White, Richard K. Guy, and Renate Scheidler, Difference Necklaces, arXiv:2006.15250 [math.CO], 2020.
Index entries for linear recurrences with constant coefficients, signature (0,1,0,1).

Cf. A000045, A002524, A002525, A002526, A002527, A002528, A002529, A072827.
Cf. A072850, A072851, A072852, A072853, A072854, A072855, A072856, A099574.
Cf. A079955 - A080014.

A079977:= func< n | (1+(-1)^n)*Fibonacci(Floor((n+2)/2))/2 >;
[A079977(n): n in [0..50]]; // G. C. Greubel, Jul 25 2022

Riffle[Fibonacci[Range[50]],0] (* Harvey P. Dale, Dec 20 2015 *)

a(n)=if(n%2,0,fibonacci(n/2+1)) \\ Charles R Greathouse IV, Jun 11 2015

def A079977(n): return ((n+1)%2)*fibonacci((n+2)//2)
[A079977(n) for n in (0..50)] # G. C. Greubel, Jul 25 2022

a(n) = A000045(k+1) if n=2k, a(n)=0 otherwise.
a(n) = a(n-2) + a(n-4).
G.f.: 1/(1 - x^2 - x^4).

Editorial note: normally the alternate zeros are omitted from sequences like this. This entry is an exception. - N. J. A. Sloane

cp's OEIS Frontend

A079978 Characteristic function of multiples of three.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

Extensions

A072856 Number of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A072827 Number of permutations satisfying i-2<=p(i)<=i+3, i=1..n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A072850 Number of permutations satisfying i-2<=p(i)<=i+4, i=1..n.

Views

Author

Keywords

Links

Crossrefs

Formula

A080014 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={1}.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A079955 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A079998 The characteristic function of the multiples of five.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple