Sequences
392,541 sequences
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057164.A081161
Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057164.
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057163.A081162
Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057163.
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057163.A081163
Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057163.
- Number of distinct cycle lengths in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.A081164
Number of distinct cycle lengths in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.
- Largest prime factor of A060114.A081165
Largest prime factor of A060114.
- Number of distinct primes dividing A060114(n).A081166
Number of distinct primes dividing A060114(n).
- Number of cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.A081167
Number of cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506.
- Differences of Beatty sequence for square root of 10.A081168
Differences of Beatty sequence for square root of 10.
- Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> 3*x-1 if x is odd, stopping when reaching 1, 5 or 17.A081169
Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> 3*x-1 if x is odd, stopping when reaching 1, 5 or 17.
- Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> x-3 if x is odd, stopping when reach 0 or 1.A081170
Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> x-3 if x is odd, stopping when reach 0 or 1.
- Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> 3x-3 if x is odd, stopping when reaching one of 1, 3, 5, 15, 51.A081171
Triangle in which n-th row gives trajectory of n (including n itself) under the map x -> x/2 if x is even, x -> 3x-3 if x is odd, stopping when reaching one of 1, 3, 5, 15, 51.
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = 1, a(2) = 0.A081172
Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = 1, a(2) = 0.
- a(1) = 2, then a(n) = greatest prime factor of (a(n-1)^2+2).A081173
a(1) = 2, then a(n) = greatest prime factor of (a(n-1)^2+2).
- Numerators of constants arising in calculation of higher correlations of short divisor sums.A081174
Numerators of constants arising in calculation of higher correlations of short divisor sums.
- Numbers of the form Sum_{i=1..k} i^j, j >= 1, k >= 1.A081175
Numbers of the form Sum_{i=1..k} i^j, j >= 1, k >= 1.
- Loony stack sizes in Top Entails.A081176
Loony stack sizes in Top Entails.
- Values of r in the terms of A067688.A081177
Values of r in the terms of A067688.
- a(0) = 1; for n>=1, a(n) = Sum_{k=0..n} 7^k*N(n,k), where N(n,k)=(1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).A081178
a(0) = 1; for n>=1, a(n) = Sum_{k=0..n} 7^k*N(n,k), where N(n,k)=(1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).
- 3rd binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081179
3rd binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- 4th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081180
4th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- Staircase on Pascal's triangle.A081181
Staircase on Pascal's triangle.
- 5th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081182
5th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- 6th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081183
6th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- 7th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081184
7th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- 8th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).A081185
8th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
- 4th binomial transform of (1,0,1,0,1,...), A059841.A081186
4th binomial transform of (1,0,1,0,1,...), A059841.
- 5th binomial transform of (1,0,1,0,1,...), A059841.A081187
5th binomial transform of (1,0,1,0,1,...), A059841.
- 6th binomial transform of (1,0,1,0,1,.....), A059841.A081188
6th binomial transform of (1,0,1,0,1,.....), A059841.
- 7th binomial transform of (1,0,1,0,1,...), A059841.A081189
7th binomial transform of (1,0,1,0,1,...), A059841.
- 8th binomial transform of (1,0,1,0,1,.....), A059841.A081190
8th binomial transform of (1,0,1,0,1,.....), A059841.
- Duplicate of A060531.A081191
Duplicate of A060531.
- 10th binomial transform of (1,0,1,0,1,......), A059841.A081192
10th binomial transform of (1,0,1,0,1,......), A059841.
- a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9.A081193
a(n) = 6*a(n-1)-8*a(n-2) for n>1, a(0)=1, a(1)=9.
- a(n) = 8*a(n-1) -15*a(n-2), a(0)=1, a(1)=16.A081194
a(n) = 8*a(n-1) -15*a(n-2), a(0)=1, a(1)=16.
- a(n) = 10*a(n-1)-24*a(n-2) for n>1, a(0)=1, a(1)=25.A081195
a(n) = 10*a(n-1)-24*a(n-2) for n>1, a(0)=1, a(1)=25.
- a(n) = (n+4)^n*binomial(n+2,2).A081196
a(n) = (n+4)^n*binomial(n+2,2).
- Diagonal sums of A081130.A081197
Diagonal sums of A081130.
- Smallest stack size with an unentailed Grundy value of 2^n in Top Entails.A081198
Smallest stack size with an unentailed Grundy value of 2^n in Top Entails.
- 5th binomial transform of (0,1,0,1,...), A000035.A081199
5th binomial transform of (0,1,0,1,...), A000035.
- 6th binomial transform of (0,1,0,1,0,1,...), A000035.A081200
6th binomial transform of (0,1,0,1,0,1,...), A000035.
- 7th binomial transform of (0,1,0,1,0,1,....), A000035.A081201
7th binomial transform of (0,1,0,1,0,1,....), A000035.
- 8th binomial transform of (0,1,0,1,0,1,....), A000035.A081202
8th binomial transform of (0,1,0,1,0,1,....), A000035.
- 9th binomial transform of (0,1,0,1,0,1,.....), A000035.A081203
9th binomial transform of (0,1,0,1,0,1,.....), A000035.
- Staircase on Pascal's triangle.A081204
Staircase on Pascal's triangle.
- Staircase on Pascal's triangle.A081205
Staircase on Pascal's triangle.
- Correlation matrix of triangle A046854.A081206
Correlation matrix of triangle A046854.
- Main diagonal of number square A081206.A081207
Main diagonal of number square A081206.
- Smallest prime which begins with all the n-digit primes.A081208
Smallest prime which begins with all the n-digit primes.
- a(n) = Sum_{k=0..n} (-1)^(n-k)*n^k.A081209
a(n) = Sum_{k=0..n} (-1)^(n-k)*n^k.
- In prime factorization of n replace each prime power p^e with the greatest squarefree number <= p^e.A081210
In prime factorization of n replace each prime power p^e with the greatest squarefree number <= p^e.