Sequences
392,541 sequences
- Number of ferrites M_4Y_n that repeat after 6n+20 layers.A011961
Number of ferrites M_4Y_n that repeat after 6n+20 layers.
- Number of ferrites M_6Y_n that repeat after 6n+30 layers.A011962
Number of ferrites M_6Y_n that repeat after 6n+30 layers.
- Number of ferrites M_8Y_n that repeat after 6n+40 layers.A011963
Number of ferrites M_8Y_n that repeat after 6n+40 layers.
- Number of ferrites M_{10}Y_n that repeat after 6n+50 layers.A011964
Number of ferrites M_{10}Y_n that repeat after 6n+50 layers.
- Second differences of Bell numbers.A011965
Second differences of Bell numbers.
- Third differences of Bell numbers.A011966
Third differences of Bell numbers.
- 4th differences of Bell numbers.A011967
4th differences of Bell numbers.
- Apply (1+Shift) to Bell numbers.A011968
Apply (1+Shift) to Bell numbers.
- Apply (1+Shift)^2 to Bell numbers.A011969
Apply (1+Shift)^2 to Bell numbers.
- Apply (1+Shift)^3 to Bell numbers.A011970
Apply (1+Shift)^3 to Bell numbers.
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).A011971
Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).
- Sequence formed by reading rows of triangle defined in A011971.A011972
Sequence formed by reading rows of triangle defined in A011971.
- Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.A011973
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.
- 2 followed by the numbers that are the sum of 2 successive primes.A011974
2 followed by the numbers that are the sum of 2 successive primes.
- Covering numbers C(n,3,2).A011975
Covering numbers C(n,3,2).
- Covering numbers C(n,4,2).A011976
Covering numbers C(n,4,2).
- Covering numbers C(n,5,2).A011977
Covering numbers C(n,5,2).
- Covering numbers C(n,6,2).A011978
Covering numbers C(n,6,2).
- Covering numbers C(n,4,3) (next term is <= 261).A011979
Covering numbers C(n,4,3) (next term is <= 261).
- Covering numbers C(n,5,3) (next term is <= 29).A011980
Covering numbers C(n,5,3) (next term is <= 29).
- Covering numbers C(n,6,3) (next term is <= 21).A011981
Covering numbers C(n,6,3) (next term is <= 21).
- Covering numbers C(n,7,3) (next term is <= 25).A011982
Covering numbers C(n,7,3) (next term is <= 25).
- Covering numbers C(n,5,4).A011983
Covering numbers C(n,5,4).
- Covering numbers C(n,6,4) (next term is <= 41).A011984
Covering numbers C(n,6,4) (next term is <= 41).
- Covering numbers C(n,7,4) (next term is <= 24).A011985
Covering numbers C(n,7,4) (next term is <= 24).
- Covering numbers C(n,7,4) (next term is <= 19).A011986
Covering numbers C(n,7,4) (next term is <= 19).
- Covering numbers C(n,6,5) (next term is <= 100).A011987
Covering numbers C(n,6,5) (next term is <= 100).
- Covering numbers C(n,7,5) (next term is <= 34).A011988
Covering numbers C(n,7,5) (next term is <= 34).
- Covering numbers C(n,8,5) (next term is <= 43).A011989
Covering numbers C(n,8,5) (next term is <= 43).
- Covering numbers C(n,9,5) (next term is <= 19).A011990
Covering numbers C(n,9,5) (next term is <= 19).
- (n,3,1) difference families over Z_n.A011991
(n,3,1) difference families over Z_n.
- (n,3,2) difference families over Z_n.A011992
(n,3,2) difference families over Z_n.
- (2n+1,3,3) difference families over Z_{2n+1}.A011993
(2n+1,3,3) difference families over Z_{2n+1}.
- (n,3,4) difference families over Z_n.A011994
(n,3,4) difference families over Z_n.
- (n,3,5) difference families over Z_n.A011995
(n,3,5) difference families over Z_n.
- (n,3,6) difference families over Z_n.A011996
(n,3,6) difference families over Z_n.
- Number of (n,3,7) difference families over Z_n.A011997
Number of (n,3,7) difference families over Z_n.
- (n,3,8) difference families over Z_n.A011998
(n,3,8) difference families over Z_n.
- (2n+1,3,9) difference families over Z_{2n+1}.A011999
(2n+1,3,9) difference families over Z_{2n+1}.
- Expansion of 1/sqrt(1 - 4*x + 16*x^2).A012000
Expansion of 1/sqrt(1 - 4*x + 16*x^2).
- E.g.f.: -tan(log(cos(x))), even powers only.A012001
E.g.f.: -tan(log(cos(x))), even powers only.
- arctan(log(cos(x)))=-1/2!*x^2-2/4!*x^4+14/6!*x^6+568/8!*x^8...A012002
arctan(log(cos(x)))=-1/2!*x^2-2/4!*x^4+14/6!*x^6+568/8!*x^8...
- E.g.f. cos(log(cos(x))), even powers only.A012003
E.g.f. cos(log(cos(x))), even powers only.
- arcsinh(log(cos(x)))=-1/2!*x^2-2/4!*x^4-1/6!*x^6+148/8!*x^8-61/10!*x^10...A012004
arcsinh(log(cos(x)))=-1/2!*x^2-2/4!*x^4-1/6!*x^6+148/8!*x^8-61/10!*x^10...
- tanh(log(cos(x)))=-1/2!*x^2-2/4!*x^4+14/6!*x^6+568/8!*x^8...A012005
tanh(log(cos(x)))=-1/2!*x^2-2/4!*x^4+14/6!*x^6+568/8!*x^8...
- -arctanh(log(cos(x))) = 1/2!*x^2+2/4!*x^4+46/6!*x^6+1112/8!*x^8...A012006
-arctanh(log(cos(x))) = 1/2!*x^2+2/4!*x^4+46/6!*x^6+1112/8!*x^8...
- cosh(log(cos(x))) = 1+3/4!*x^4+30/6!*x^6+693/8!*x^8+25260/10!*x^10...A012007
cosh(log(cos(x))) = 1+3/4!*x^4+30/6!*x^6+693/8!*x^8+25260/10!*x^10...
- sec(log(cos(x)))= 1+3/4!*x^4+30/6!*x^6+1113/8!*x^8+50460/10!*x^10...A012008
sec(log(cos(x)))= 1+3/4!*x^4+30/6!*x^6+1113/8!*x^8+50460/10!*x^10...
- Expansion of e.g.f. sech(log(cos(x))) (even exponents only).A012009
Expansion of e.g.f. sech(log(cos(x))) (even exponents only).
- arctan(sin(sin(x))) = x - 4/3!*x^3 + 76/5!*x^5 - 3592/7!*x^7 + 317968/9!*x^9 - ....A012010
arctan(sin(sin(x))) = x - 4/3!*x^3 + 76/5!*x^5 - 3592/7!*x^7 + 317968/9!*x^9 - ....