A120118 -id:A120118 - cp's OEIS frontend

A241936 T(n,k)=Number of length n+4 0..k arrays with no consecutive five elements summing to more than 2*k.

16, 96, 26, 357, 218, 43, 1007, 1043, 509, 71, 2373, 3599, 3150, 1187, 116, 4928, 10031, 13339, 9500, 2727, 186, 9318, 24052, 44063, 49355, 28153, 6105, 300, 16389, 51570, 122162, 193179, 179145, 80983, 13783, 487, 27214, 101421, 297324, 619132, 829867

Offset: 1

R. H. Hardin, May 02 2014

Table starts
..16....96....357....1007.....2373.....4928......9318.....16389......27214
..26...218...1043....3599....10031....24052.....51570....101421.....186208
..43...509...3150...13339....44063...122162....297324....654345....1329163
..71..1187...9500...49355...193179...619132...1710198...4211175....9462805
.116..2727..28153..179145...829867..3072022...9624440..26502761...65852820
.186..6105..80983..629639..3446359.14718452..52254450.160807307..441594824
.300.13783.235307.2237881.14484953.71410234.287426800.988849923.3001975962

			Some solutions for n=4 k=4
..4....2....0....2....1....1....3....0....1....3....1....1....1....3....4....0
..1....1....1....0....1....4....0....1....2....0....2....0....1....1....0....0
..3....1....1....4....2....1....0....1....1....4....2....0....0....0....0....2
..0....2....0....2....2....2....1....0....0....0....0....0....3....1....0....0
..0....2....1....0....2....0....1....1....2....1....2....0....0....1....0....0
..0....1....1....1....1....1....0....4....2....1....0....2....0....3....0....0
..4....0....2....0....0....1....1....0....0....1....3....3....3....0....0....4
..0....0....0....2....0....0....1....3....1....0....1....3....1....1....1....4

R. H. Hardin, Table of n, a(n) for n = 1..2353

Column 1 is A120118(n+4)

Empirical for column k:
k=1: a(n)=a(n-1)+a(n-3)+2*a(n-5)-a(n-8)-a(n-10)
k=2: [order 45]
Empirical for row n:
n=1: [polynomial of degree 5]
n=2: [polynomial of degree 6]
n=3: [polynomial of degree 7]
n=4: [polynomial of degree 8]
n=5: [polynomial of degree 9]
n=6: [polynomial of degree 10]
n=7: [polynomial of degree 11]

A334251 a(n) is the number of binary (0,1) sequences of length n that have at most two zeros in a window of seven consecutive symbols.

Original entry on oeis.org

1, 2, 4, 7, 11, 16, 22, 29, 43, 66, 102, 157, 239, 358, 526, 777, 1159, 1740, 2619, 3942, 5923, 8870, 13259, 19822, 29667, 44451, 66641, 99912, 149745, 224338, 335993, 503199, 753720, 1129164, 1691796, 2534807, 3797721, 5689507, 8523275, 12768309, 19127928, 28655867, 42930562

Offset: 0

Kees Immink, Apr 20 2020

Application: Not all electronic devices connected to the Internet of Things (IoT) have batteries or are connected to the power cable. These self-contained devices must rely on the harvesting of energy of the signals sent by a transmitter. We investigate binary systems emitting 0's and 1's signals where it is assumed that the 1's carry the energy. A minimal number of 1's in transmitted sequences is required so as to carry sufficient energy within a prescribed time span. A binary sequence is said to obey the sliding-window (ell,t)-constraint if the number of 1's within any window of ell consecutive bits of that sequence is at least t, t

			a(3) = 7 as there are 8 possible binary (0,1) sequences of length 3 but exactly one of them has more than 2 zero's in a window of seven consecutive symbols (the sequence (000)) leaving 8-1 = 7 such sequences. - _David A. Corneth_, Apr 20 2020

Kees Immink, Table of n, a(n) for n = 0..50

Cf. A118647, A120118, A133523.

G.f.: (x^20 +x^19 +x^18 +2*x^17 +2*x^16 +x^15 -3*x^13 -4*x^12 -5*x^11 -7*x^10 -5*x^9 -3*x^8 -3*x^7 +2*x^6 +3*x^5 +3*x^4 +3*x^3 +2*x^2 +x +1) / (-x^21 -x^18 +x^15 +3*x^14 +x^12 +2*x^11 -3*x^7 -x^4 -x +1).
From David A. Corneth, Apr 21 2020: (Start)
a(n) ~ c*r^n where c = 1.81880731105 and r = 1.498122533939865577.
a(n) = a(n - 1) + a(n - 4) + 3*a(n - 6) - 2*a(n - 10) - a(n - 12) - 3*a(n - 13) - a(n - 15) + a(n - 18) + a(n - 21), n >= 21. (End)

A335247 a(n) is the number of binary (0,1) sequences of length n that have at least two ones in each window of eight consecutive symbols.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 127, 247, 487, 961, 1897, 3745, 7393, 14593, 28801, 56833, 112156, 221341, 436825, 862094, 1701380, 3357739, 6626611, 13077820, 25809478, 50935832, 100523529, 198386490, 391522260, 772682018, 1524913233, 3009466064, 5939279536, 11721362180

Offset: 0

Kees Immink, May 28 2020

Application: Not all electronic devices connected to the Internet of Things (IoT) have batteries or are connected to the power cable. These self-contained devices must rely on the harvesting of energy of the signals sent by a transmitter. A minimal number of 1's in transmitted sequences is required so as to carry sufficient energy within a prescribed time span. A binary sequence is said to obey the sliding-window (ell,t)-constraint if the number of 1's within any window of ell consecutive bits of that sequence is at least t, t

Georg Fischer, Table of n, a(n) for n = 0..1000
Kees Immink and Kui Cai, Properties and constructions of energy-harvesting sliding-window constrained code, IEEE Communications Letters, May 2020.
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,0,1,2,3,0,-3,-4,-3,0,0,-2,-3,0,0,3,3,0,0,0,1,0,0,0,-1).

Cf. A118647, A120118, A133523, A334251, A133551.

CoefficientList[Series[-(x^27 +x^26 -x^23 -x^22 -3*x^19 -5*x^18 -3*x^17 +3*x^15 +4*x^14 +2*x^13 +3*x^11 +5*x^10 +5*x^9 +3*x^8 -3*x^7 -3*x^6 -2*x^5 -x^4 -x^3 -x^2 -x -1) / (x^28 -x^24 -3*x^20 -3*x^19 +3*x^16 +2*x^15 +3*x^12 +4*x^11 +3*x^10 -3*x^8 -2*x^7 -x^6 -x^4 -x^3 -x^2 -x +1),{x,0,100}],x] (* Georg Fischer, Oct 26 2020 *)
LinearRecurrence[{1,1,1,1,0,1,2,3,0,-3,-4,-3,0,0,-2,-3,0,0,3,3,0,0,0,1,0,0,0,-1},{1,2,4,8,16,32,64,127,247,487,961,1897,3745,7393,14593,28801,56833,112156,221341,436825,862094,1701380,3357739,6626611,13077820,25809478,50935832,100523529},40] (* Harvey P. Dale, Feb 21 2022 *)

G.f.: -(x^27+x^26-x^23-x^22-3*x^19-5*x^18-3*x^17+3*x^15+4*x^14+2*x^13 +3*x^11 +5*x^10+5*x^9+3*x^8-3*x^7-3*x^6-2*x^5-x^4-x^3-x^2-x-1) / (x^28-x^24-3*x^20 -3*x^19 +3*x^16 +2*x^15+3*x^12+4*x^11+3*x^10-3*x^8-2*x^7-x^6-x^4-x^3-x^2-x+1).
a(n) = a(n-1)+a(n-2)+a(n-3)+a(n-4)+a(n-6)+2*a(n-7)+3*a(n-8)-3*a(n-10) -4*a(n-11) -3*a(n-12) -2*a(n-15)-3*a(n-16)+3*a(n-19)+3*a(n-20)+a(n-24)-a(n-28), n>28.
a(n) ~ c*r^n where c = 1.07317641333 and r = 1.9735326811117101072.

A125513 a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 4 or more ones.

Original entry on oeis.org

2, 4, 8, 15, 26, 48, 89, 165, 305, 561, 1034, 1908, 3521, 6496, 11982, 22101, 40770, 75210, 138741, 255934, 472117, 870911, 1606567, 2963628, 5466988, 10084919, 18603592, 34317946, 63306130, 116780470, 215424285, 397391986, 733066807

Offset: 1

Tanya Khovanova, Dec 28 2006

nonn

Index entries for linear recurrences with constant coefficients, signature (1, 1, 0, 1, 2, 0, -1, 0, 0, -1).

This sequence is similar to the sequences A118647 (where no substring of length 4 contains 3 or more ones), because the number of ones we are checking for is one less than the length of a substring. It is also similar to A120118 (where no substring of length 5 contains 3 or more ones.).

a(n) = a(n-1) + a(n-2) + a(n-4) + 2a(n-5) - a(n-7) - a(n-10).

G.f.: x*(2+2*x+2*x^2+3*x^3+x^4-x^5-x^6-x^7-x^8-x^9)/(1-x-x^2-x^4-2*x^5+x^7+x^ 10) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 26 2009]

G.f. proposed by Maksym Voznyy checked and corrected by R. J. Mathar, Sep 16 2009.

A131283 a(n) is the number of binary strings of length n such that there exist 3 or more ones in a subsequence of length 5 or less.

Original entry on oeis.org

0, 0, 1, 5, 16, 38, 85, 185, 396, 838, 1748, 3609, 7400, 15097, 30681, 62154, 125588, 253246, 509850, 1025153, 2059159, 4132679, 8288643, 16615051, 33291367, 66682128, 133525499, 267312553, 535049374, 1070786975, 2142690382

Offset: 1

Tanya Khovanova, Sep 28 2007

Index entries for linear recurrences with constant coefficients, signature (3,-2,1,-2,2,-4,0,-1,2,-1,2).

Cf. A118646, A118647.

concat([0, 0], Vec(x^3*(1+2*x+3*x^2-x^6-x^7-x^3-2*x^5) / ( (1-2*x)*(1-x-x^3-2*x^5+x^8+x^10) ) + O(x^40))) \\ Michel Marcus, May 28 2020

a(n) = 2^n - A120118(n).
a(n)= +3*a(n-1) -2*a(n-2) +a(n-3) -2*a(n-4) +2*a(n-5) -4*a(n-6) -a(n-8) +2*a(n-9) -a(n-10) +2*a(n-11).
G.f.: x^3*(1 +2*x +3*x^2 -x^6 -x^7 -x^3 -2*x^5) / ( (1-2*x)*(1-x-x^3-2*x^5+x^8+x^10) ). - R. J. Mathar, Nov 28 2011

Showing 1-5 of 5 results.

cp's OEIS Frontend

A241936 T(n,k)=Number of length n+4 0..k arrays with no consecutive five elements summing to more than 2*k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A334251 a(n) is the number of binary (0,1) sequences of length n that have at most two zeros in a window of seven consecutive symbols.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A335247 a(n) is the number of binary (0,1) sequences of length n that have at least two ones in each window of eight consecutive symbols.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A125513 a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 4 or more ones.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A131283 a(n) is the number of binary strings of length n such that there exist 3 or more ones in a subsequence of length 5 or less.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula