Sequences
392,541 sequences
- a(n) = 2^n - 1 + 2*Fibonacci(n-1).A060161
a(n) = 2^n - 1 + 2*Fibonacci(n-1).
- Triangle T(n,m) with T(n,m)=T(n-1,|m-1|)+T(n-1,m)+T(n-1,m+1)-2T(n-2,m) and T(0,0)=1.A060162
Triangle T(n,m) with T(n,m)=T(n-1,|m-1|)+T(n-1,m)+T(n-1,m+1)-2T(n-2,m) and T(0,0)=1.
- a(n) = (n^3 + 5*n + 18)/6.A060163
a(n) = (n^3 + 5*n + 18)/6.
- Number of orbits of length n under the map whose periodic points are counted by A000364.A060164
Number of orbits of length n under the map whose periodic points are counted by A000364.
- Number of orbits of length n under the map whose periodic points are counted by A000984.A060165
Number of orbits of length n under the map whose periodic points are counted by A000984.
- Number of orbits of length n under the map whose periodic points are counted by A001641.A060166
Number of orbits of length n under the map whose periodic points are counted by A001641.
- Number of orbits of length n under the map whose periodic points are counted by A001642.A060167
Number of orbits of length n under the map whose periodic points are counted by A001642.
- Number of orbits of length n under the map whose periodic points are counted by A001643.A060168
Number of orbits of length n under the map whose periodic points are counted by A001643.
- Number of orbits of length n under the automorphism of the 3-torus whose periodic points are counted by A001945.A060169
Number of orbits of length n under the automorphism of the 3-torus whose periodic points are counted by A001945.
- Number of orbits of length n under the map whose periodic points are counted by A005809.A060170
Number of orbits of length n under the map whose periodic points are counted by A005809.
- Number of orbits of length n under a map whose periodic points seem to be counted by A006953.A060171
Number of orbits of length n under a map whose periodic points seem to be counted by A006953.
- Number of orbits of length n under a map whose periodic points are counted by A027306.A060172
Number of orbits of length n under a map whose periodic points are counted by A027306.
- Number of orbits of length n under a map whose periodic points are counted by A056045.A060173
Number of orbits of length n under a map whose periodic points are counted by A056045.
- Dimensions of graded algebra associated with forest meanders (subalgebra version).A060174
Dimensions of graded algebra associated with forest meanders (subalgebra version).
- Square array A(n,k) = exponent of the largest power of k-th prime which divides n, read by falling antidiagonals.A060175
Square array A(n,k) = exponent of the largest power of k-th prime which divides n, read by falling antidiagonals.
- Square array A(n,k) = the largest power of k-th prime which divides n, read by falling antidiagonals.A060176
Square array A(n,k) = the largest power of k-th prime which divides n, read by falling antidiagonals.
- Triangle of generalized sum of divisors function, read by rows.A060177
Triangle of generalized sum of divisors function, read by rows.
- Sum of orders of all odd permutations of n letters.A060178
Sum of orders of all odd permutations of n letters.
- Sum of distinct orders of degree-n permutations.A060179
Sum of distinct orders of degree-n permutations.
- Sum of distinct orders of degree-n even permutations.A060180
Sum of distinct orders of degree-n even permutations.
- Number of permutations in the symmetric group S_n whose order is 1 or prime.A060181
Number of permutations in the symmetric group S_n whose order is 1 or prime.
- a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2.A060182
a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2.
- a(0)=1, a(n) = 100*a(n-1) + 36*n - 128.A060183
a(0)=1, a(n) = 100*a(n-1) + 36*n - 128.
- Triangle of generalized sum of divisors function, read by rows.A060184
Triangle of generalized sum of divisors function, read by rows.
- Generalized sum of divisors function: second diagonal of A060184.A060185
Generalized sum of divisors function: second diagonal of A060184.
- Generalized sum of divisors function: third diagonal of A060184.A060186
Generalized sum of divisors function: third diagonal of A060184.
- Triangle read by rows: Eulerian numbers of type B, T(n,k) (1 <= k <= n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (2*n - 2*k + 1)*T(n-1, k-1) + (2*k - 1)*T(n-1, k).A060187
Triangle read by rows: Eulerian numbers of type B, T(n,k) (1 <= k <= n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (2*n - 2*k + 1)*T(n-1, k-1) + (2*k - 1)*T(n-1, k).
- A column and diagonal of A060187.A060188
A column and diagonal of A060187.
- A column and diagonal of A060187 (k=3).A060189
A column and diagonal of A060187 (k=3).
- A column and diagonal of A060187 (k=4).A060190
A column and diagonal of A060187 (k=4).
- Union_i p(4i), p(4i+1), where p(k) = k-th prime.A060191
Union_i p(4i), p(4i+1), where p(k) = k-th prime.
- Union_i p(4i+2), p(4i+3), where p(k) = k-th prime.A060192
Union_i p(4i+2), p(4i+3), where p(k) = k-th prime.
- Partial products of A060191.A060193
Partial products of A060191.
- Partial products of A060192.A060194
Partial products of A060192.
- a(n) = 8^(n-1)*(2^n - 1).A060195
a(n) = 8^(n-1)*(2^n - 1).
- Decimal expansion of 1 + 1/(1*3) + 1/(1*3*5) + 1/(1*3*5*7) + ...A060196
Decimal expansion of 1 + 1/(1*3) + 1/(1*3*5) + 1/(1*3*5*7) + ...
- Start at n, repeatedly apply pi(x) until reach 0; a(n) = number of steps to reach 0.A060197
Start at n, repeatedly apply pi(x) until reach 0; a(n) = number of steps to reach 0.
- Dimensions of graded algebra associated with forest meanders.A060198
Dimensions of graded algebra associated with forest meanders.
- Number of primes between n^3 and (n+1)^3.A060199
Number of primes between n^3 and (n+1)^3.
- Number of Sophie Germain primes <= prime(2^n).A060200
Number of Sophie Germain primes <= prime(2^n).
- Images of centered hexamorphic numbers: suppose k-th centered hexagonal number H_c(k) (A003215) ends in k; sequence gives value of H_c(k).A060201
Images of centered hexamorphic numbers: suppose k-th centered hexagonal number H_c(k) (A003215) ends in k; sequence gives value of H_c(k).
- Let G = complete graph on 4 vertices, create the sequence G, L(G), L(L(G)), L(L(L(G))), ... where each graph in this sequence is the line graph of the previous graph; a(n) is number of vertices of the n-th graph in this sequence.A060202
Let G = complete graph on 4 vertices, create the sequence G, L(G), L(L(G)), L(L(L(G))), ... where each graph in this sequence is the line graph of the previous graph; a(n) is number of vertices of the n-th graph in this sequence.
- Least cube root of unity mod p, greater than 1, where p is the n-th prime congruent to 1 mod 3.A060203
Least cube root of unity mod p, greater than 1, where p is the n-th prime congruent to 1 mod 3.
- Square pyramorphic numbers: suppose the k-th square pyramidal number S(k) (A000330) ends in k; sequence gives value of S(k).A060204
Square pyramorphic numbers: suppose the k-th square pyramidal number S(k) (A000330) ends in k; sequence gives value of S(k).
- (p^p)^p, where p is prime(n).A060205
(p^p)^p, where p is prime(n).
- Number of rotationally symmetric closed meanders of length 4n+2.A060206
Number of rotationally symmetric closed meanders of length 4n+2.
- Start at 2^n, iterate function PrimePi (A000720) until fixed point is reached; sequence gives number of steps.A060207
Start at 2^n, iterate function PrimePi (A000720) until fixed point is reached; sequence gives number of steps.
- a(n) = 2*pi(n) - pi(2*n), where pi(i) = A000720(i).A060208
a(n) = 2*pi(n) - pi(2*n), where pi(i) = A000720(i).
- Dunckley sequence: number of bases in which the n-th composite number is a Smith number.A060209
Dunckley sequence: number of bases in which the n-th composite number is a Smith number.
- Largest prime factor of 1+smaller term of twin primes.A060210
Largest prime factor of 1+smaller term of twin primes.