cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A341704 a(n) = 20*binomial(n,6) + 2*binomial(n,3) + 1.

Original entry on oeis.org

1, 1, 1, 3, 9, 21, 61, 211, 673, 1849, 4441, 9571, 18921, 34893, 60789, 101011, 161281, 248881, 372913, 544579, 777481, 1087941, 1495341, 2022483, 2695969, 3546601, 4609801, 5926051, 7541353, 9507709, 11883621, 14734611, 18133761, 22162273, 26910049, 32476291
Offset: 0

Views

Author

Enrique Navarrete, Feb 17 2021

Keywords

Comments

a(n) is the number of ternary strings of length n that contain either none or three 0's and either none or three 1's.

Examples

			a(7)=211 since the strings are the 140 permutations of 0001112, the 35 permutations of 0002222, the 35 permutations of 1112222, and 2222222.
		

Crossrefs

Formula

E.g.f.: exp(x)*(1 + x^3/6)^2.
O.g.f.:(1 - 6*x + 15*x^2 - 18*x^3 + 9*x^4 + 19*x^6)/(1 - x)^7. - Stefano Spezia, Feb 19 2021

A341705 a(n) = 70*binomial(n,8) + 2*binomial(n,4) + 1.

Original entry on oeis.org

1, 1, 1, 1, 3, 11, 31, 71, 211, 883, 3571, 12211, 35641, 91521, 212213, 453181, 904541, 1706461, 3069181, 5298493, 8827591, 14256271, 22398531, 34339691, 51504223, 75735551, 109389151, 155440351, 217608301, 300497653, 409759561, 552273681, 736352921, 971972761
Offset: 0

Views

Author

Enrique Navarrete, Feb 17 2021

Keywords

Comments

a(n) is the number of ternary strings of length n that contain either none or four 0's and either none or four 1's.

Examples

			a(9)=883 since the strings are the 630 permutations of 000011112, the 126 permutations of 000022222, the 126 permutations of 111122222, and 222222222.
		

Crossrefs

Formula

E.g.f.: exp(x)*(1 + x^4/24)^2.
O.g.f.:(1 - 8*x + 28*x^2 - 56*x^3 + 72*x^4 - 64*x^5 + 40*x^6 - 16*x^7 + 73*x^8)/(1 - x)^9. - Stefano Spezia, Feb 19 2021
Showing 1-2 of 2 results.