Sequences
392,541 sequences
- Second binomial transform of expansion of exp(cosh(2*x)).A081561
Second binomial transform of expansion of exp(cosh(2*x)).
- Binomial transform of expansion of exp(2cosh(x)), A000807.A081562
Binomial transform of expansion of exp(2cosh(x)), A000807.
- Second binomial transform of expansion of exp(2*cosh(x)).A081563
Second binomial transform of expansion of exp(2*cosh(x)).
- Erroneous duplicate of A119809.A081564
Erroneous duplicate of A119809.
- Binomial transform of expansion of exp(3cosh(x)).A081565
Binomial transform of expansion of exp(3cosh(x)).
- Second binomial transform of expansion of exp(3cosh(x)).A081566
Second binomial transform of expansion of exp(3cosh(x)).
- Second binomial transform of F(n+1).A081567
Second binomial transform of F(n+1).
- Third binomial transform of Fibonacci(n+1).A081568
Third binomial transform of Fibonacci(n+1).
- Fourth binomial transform of F(n+1).A081569
Fourth binomial transform of F(n+1).
- Fifth binomial transform of F(n+1).A081570
Fifth binomial transform of F(n+1).
- Sixth binomial transform of F(n+1).A081571
Sixth binomial transform of F(n+1).
- Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals.A081572
Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals.
- Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < e = 2.718... .A081573
Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < e = 2.718... .
- Fourth binomial transform of Fibonacci numbers F(n).A081574
Fourth binomial transform of Fibonacci numbers F(n).
- Fifth binomial transform of Fibonacci numbers F(n).A081575
Fifth binomial transform of Fibonacci numbers F(n).
- Square array of binomial transforms of Fibonacci numbers, read by antidiagonals.A081576
Square array of binomial transforms of Fibonacci numbers, read by antidiagonals.
- Pascal-(1,2,1) array read by antidiagonals.A081577
Pascal-(1,2,1) array read by antidiagonals.
- Pascal-(1,3,1) array.A081578
Pascal-(1,3,1) array.
- Pascal-(1,4,1) array.A081579
Pascal-(1,4,1) array.
- Pascal-(1,5,1) array.A081580
Pascal-(1,5,1) array.
- Pascal-(1,6,1) array.A081581
Pascal-(1,6,1) array.
- Pascal-(1,7,1) array.A081582
Pascal-(1,7,1) array.
- Third row of Pascal-(1,2,1) array A081577.A081583
Third row of Pascal-(1,2,1) array A081577.
- Fourth row of Pascal-(1,2,1) array A081577.A081584
Fourth row of Pascal-(1,2,1) array A081577.
- Third row of Pascal-(1,3,1) array A081578.A081585
Third row of Pascal-(1,3,1) array A081578.
- Fourth row of Pascal-(1,3,1) array A081578.A081586
Fourth row of Pascal-(1,3,1) array A081578.
- Third row of Pascal-(1,4,1) array A081579.A081587
Third row of Pascal-(1,4,1) array A081579.
- Fourth row of the Pascal-(1,4,1) array A081579.A081588
Fourth row of the Pascal-(1,4,1) array A081579.
- Third row of Pascal-(1,5,1) array A081580.A081589
Third row of Pascal-(1,5,1) array A081580.
- Fourth row of Pascal-(1,5,1) array A081580.A081590
Fourth row of Pascal-(1,5,1) array A081580.
- Third row of Pascal-(1,6,1) array A081581.A081591
Third row of Pascal-(1,6,1) array A081581.
- A self generating sequence: "there are n a(n)'s in the sequence". Start with 1,2 and use the rule : "a(n)=k implies there are n following k's (k is 1 or 2)".A081592
A self generating sequence: "there are n a(n)'s in the sequence". Start with 1,2 and use the rule : "a(n)=k implies there are n following k's (k is 1 or 2)".
- Third row of Pascal-(1,7,1) array A081582.A081593
Third row of Pascal-(1,7,1) array A081582.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 2x+y.A081594
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 2x+y.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 4x+y.A081595
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 4x+y.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 5x+y.A081596
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 5x+y.
- Let n = 10*x + y where 0 <= y <= 9, x >= 0. Then a(n) = 6*x + y.A081597
Let n = 10*x + y where 0 <= y <= 9, x >= 0. Then a(n) = 6*x + y.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 7x+y.A081598
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 7x+y.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 8x+y.A081599
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 8x+y.
- Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 9x+y.A081600
Let n = 10x + y where 0 <= y <= 9, x >= 0. Then a(n) = 9x+y.
- Numbers m such that 3 does not divide Sum_{k=0..m} binomial(2k,k) = A006134(m).A081601
Numbers m such that 3 does not divide Sum_{k=0..m} binomial(2k,k) = A006134(m).
- Number of 0's in ternary representation of n.A081602
Number of 0's in ternary representation of n.
- Number of 2's in ternary representation of n.A081603
Number of 2's in ternary representation of n.
- Number of digits in ternary representation of n.A081604
Number of digits in ternary representation of n.
- Numbers having at least one 0 in their ternary representation.A081605
Numbers having at least one 0 in their ternary representation.
- Numbers having at least one 1 in their ternary representation.A081606
Numbers having at least one 1 in their ternary representation.
- Number of numbers <= n having at least one 0 in their ternary representation.A081607
Number of numbers <= n having at least one 0 in their ternary representation.
- Number of numbers <= n having no 0 in their ternary representation.A081608
Number of numbers <= n having no 0 in their ternary representation.
- Number of numbers <= n having at least one 1 in their ternary representation.A081609
Number of numbers <= n having at least one 1 in their ternary representation.
- Number of numbers <= n having at least one 2 in their ternary representation.A081610
Number of numbers <= n having at least one 2 in their ternary representation.