Sequences
392,541 sequences
- Let s(x)=floor(phi*x) where phi is the golden ratio (1+sqrt(5))/2; sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such number exists.A081111
Let s(x)=floor(phi*x) where phi is the golden ratio (1+sqrt(5))/2; sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such number exists.
- Let s(x)=floor(Pi*x); sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such k exists.A081112
Let s(x)=floor(Pi*x); sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such k exists.
- Number of paths of length n-1 a king can take from one side of an n X n chessboard to the opposite side.A081113
Number of paths of length n-1 a king can take from one side of an n X n chessboard to the opposite side.
- Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.A081114
Triangle read by rows: T(n,k) = n*T(n-1,k) + n - k starting at T(n,n)=0.
- (p^2 - 1)/12 where p > 3 runs through the primes.A081115
(p^2 - 1)/12 where p > 3 runs through the primes.
- Numbers k such that 17 divides 3^k-k.A081116
Numbers k such that 17 divides 3^k-k.
- Differences of Beatty sequence for cube root of 2.A081117
Differences of Beatty sequence for cube root of 2.
- Triangle of first n numbers per row having exactly n 1's in binary representation.A081118
Triangle of first n numbers per row having exactly n 1's in binary representation.
- Number of integral solutions to Mordell's equation y^2 = x^3 + n.A081119
Number of integral solutions to Mordell's equation y^2 = x^3 + n.
- Number of integral solutions to Mordell's equation y^2 = x^3 - n.A081120
Number of integral solutions to Mordell's equation y^2 = x^3 - n.
- Numbers k such that Mordell's equation y^2 = x^3 - k has no integral solutions.A081121
Numbers k such that Mordell's equation y^2 = x^3 - k has no integral solutions.
- 10th binomial transform of (1,1,0,0,0,0,...).A081122
10th binomial transform of (1,1,0,0,0,0,...).
- a(n) = floor(n/2)!.A081123
a(n) = floor(n/2)!.
- Binomial transform of floor(n/2)!.A081124
Binomial transform of floor(n/2)!.
- a(n) = n! / floor(n/2)!.A081125
a(n) = n! / floor(n/2)!.
- Duplicate of A018191.A081126
Duplicate of A018191.
- 11th binomial transform of (0,1,0,0,0,0,0,...).A081127
11th binomial transform of (0,1,0,0,0,0,0,...).
- 12th binomial transform of (0,1,0,0,0,0,0,0,...).A081128
12th binomial transform of (0,1,0,0,0,0,0,0,...).
- Differences of Beatty sequence for cube root of 3.A081129
Differences of Beatty sequence for cube root of 3.
- Square array of binomial transforms of (0,0,1,0,0,0,...), read by antidiagonals.A081130
Square array of binomial transforms of (0,0,1,0,0,0,...), read by antidiagonals.
- a(n) = n^(n-2) * binomial(n,2).A081131
a(n) = n^(n-2) * binomial(n,2).
- a(n) = (n+1)^n*binomial(n+2,2).A081132
a(n) = (n+1)^n*binomial(n+2,2).
- a(n) = n^n*binomial(n+2, 2).A081133
a(n) = n^n*binomial(n+2, 2).
- Distance to nearest power of 3.A081134
Distance to nearest power of 3.
- 5th binomial transform of (0,0,1,0,0,0, ...).A081135
5th binomial transform of (0,0,1,0,0,0, ...).
- 6th binomial transform of (0,0,1,0,0,0, ...).A081136
6th binomial transform of (0,0,1,0,0,0, ...).
- Duplicate of A027474.A081137
Duplicate of A027474.
- 8th binomial transform of (0,0,1,0,0,0, ...).A081138
8th binomial transform of (0,0,1,0,0,0, ...).
- 9th binomial transform of (0,0,1,0,0,0,...).A081139
9th binomial transform of (0,0,1,0,0,0,...).
- 10th binomial transform of (0,0,1,0,0,0,...).A081140
10th binomial transform of (0,0,1,0,0,0,...).
- 11th binomial transform of (0,0,1,0,0,0,...).A081141
11th binomial transform of (0,0,1,0,0,0,...).
- 12th binomial transform of (0,0,1,0,0,0,...).A081142
12th binomial transform of (0,0,1,0,0,0,...).
- 5th binomial transform of (0,0,0,1,0,0,0,0,......).A081143
5th binomial transform of (0,0,0,1,0,0,0,0,......).
- Starting at 1, four-fold convolution of A000400 (powers of 6).A081144
Starting at 1, four-fold convolution of A000400 (powers of 6).
- a(1)=1; thereafter, a(n) is the least positive integer which has not already occurred and is such that |a(n)-a(n-1)| is different from any |a(k)-a(k-1)| which has already occurred.A081145
a(1)=1; thereafter, a(n) is the least positive integer which has not already occurred and is such that |a(n)-a(n-1)| is different from any |a(k)-a(k-1)| which has already occurred.
- Inverse permutation to A081145.A081146
Inverse permutation to A081145.
- First differences of A022839.A081147
First differences of A022839.
- Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.A081148
Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.
- Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.A081149
Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.A081150
Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.
- Number of even cycles in range [A014137(2n-1)..A014138(2n-1)] of permutation A057505/A057506.A081151
Number of even cycles in range [A014137(2n-1)..A014138(2n-1)] of permutation A057505/A057506.
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.A081152
Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.
- Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.A081153
Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.
- Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.A081154
Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.
- Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with fixed-points of both A057163 and A057164.A081155
Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with fixed-points of both A057163 and A057164.
- Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with fixed-points of both A057163 and A057164.A081156
Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with fixed-points of both A057163 and A057164.
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.A081157
Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.
- Number of even cycles in range [A014137(2n-1)..A014138(2n-1)] of permutation A057505/A057506, with no fixed points of A057164.A081158
Number of even cycles in range [A014137(2n-1)..A014138(2n-1)] of permutation A057505/A057506, with no fixed points of A057164.
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.A081159
Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057164.A081160
Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057164.