Sequences
392,541 sequences
- In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives iterate where maximal value is reached in the trajectory with that start.A060411
In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives iterate where maximal value is reached in the trajectory with that start.
- In the '3x+1' problem, these values for the starting value set new records for the "dropping time", number of steps to reach a lower value than the start.A060412
In the '3x+1' problem, these values for the starting value set new records for the "dropping time", number of steps to reach a lower value than the start.
- In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times.A060413
In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated dropping times.
- In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated maximal value reached in the trajectory with that start.A060414
In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated maximal value reached in the trajectory with that start.
- In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.A060415
In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.
- a(n) = n*4^n - 1, with a(0) = 1.A060416
a(n) = n*4^n - 1, with a(0) = 1.
- Number of different decimal digits in n-th prime.A060417
Number of different decimal digits in n-th prime.
- Largest decimal digit in n-th prime.A060418
Largest decimal digit in n-th prime.
- a(n) = floor(3^log_2(n)).A060419
a(n) = floor(3^log_2(n)).
- Least decimal digit in n-th prime.A060420
Least decimal digit in n-th prime.
- Numbers k such that the first k digits of the decimal expansion of Pi form a prime.A060421
Numbers k such that the first k digits of the decimal expansion of Pi form a prime.
- Number of acute triangles made from vertices of a regular n-gon.A060422
Number of acute triangles made from vertices of a regular n-gon.
- Number of obtuse triangles made from vertices of a regular n-gon.A060423
Number of obtuse triangles made from vertices of a regular n-gon.
- Record-setting n's for the function q(n), the minimum prime q such that n(q+1)-1 is prime p (i.e., q(n) > q(j) for all 0 < j < n).A060424
Record-setting n's for the function q(n), the minimum prime q such that n(q+1)-1 is prime p (i.e., q(n) > q(j) for all 0 < j < n).
- Primes of form n*4^n - 1.A060425
Primes of form n*4^n - 1.
- a(n) is the number of degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n that appear only once.A060426
a(n) is the number of degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n that appear only once.
- Smallest prime p such that there are n strings of consecutive integers all having products = 1 mod p.A060427
Smallest prime p such that there are n strings of consecutive integers all having products = 1 mod p.
- Numbers of form x^2 + xy + y^2 (with repetitions if more than one representation is possible).A060428
Numbers of form x^2 + xy + y^2 (with repetitions if more than one representation is possible).
- a(n) = 4*prime(n)^2+1.A060429
a(n) = 4*prime(n)^2+1.
- Residue C(2^n,n) mod C(2^n,2).A060430
Residue C(2^n,n) mod C(2^n,2).
- Number of cubefree numbers <= n.A060431
Number of cubefree numbers <= n.
- Partial sums of A002024.A060432
Partial sums of A002024.
- a(n) is the smallest odd number that can be represented as the sum of one or more consecutive primes in n ways.A060433
a(n) is the smallest odd number that can be represented as the sum of one or more consecutive primes in n ways.
- An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.A060434
An inverse to Mertens's function: smallest k >= 2 such that Mertens's function |M(k)| (see A002321) is equal to n.
- Number of functions f: {1,2,...,n} -> {1,2,...,n} with even cycles only.A060435
Number of functions f: {1,2,...,n} -> {1,2,...,n} with even cycles only.
- Numerator of Sum_{k=1..n} d(k)/k, where d() = A000005().A060436
Numerator of Sum_{k=1..n} d(k)/k, where d() = A000005().
- a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e., count each degree only once.A060437
a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e., count each degree only once.
- Triangle T(n,k), 1 <= k <= n, giving maximal size of binary code of length n and covering radius k.A060438
Triangle T(n,k), 1 <= k <= n, giving maximal size of binary code of length n and covering radius k.
- Triangle T(n,k), 1 <= k <= n, giving maximal size of ternary code of length n and covering radius k.A060439
Triangle T(n,k), 1 <= k <= n, giving maximal size of ternary code of length n and covering radius k.
- Triangle T(n,k), 1 <= k <= n, giving maximal size of code of length n and covering radius k over alphabet of size 4.A060440
Triangle T(n,k), 1 <= k <= n, giving maximal size of code of length n and covering radius k over alphabet of size 4.
- Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), with repetition.A060441
Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), with repetition.
- Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), without repetition.A060442
Triangle T(n,k), n >= 0, in which n-th row (for n >= 3) lists prime factors of Fibonacci(n) (see A000045), without repetition.
- Table T(n,k) in which n-th row lists prime factors of 2^n - 1 (n >= 2), without repetition.A060443
Table T(n,k) in which n-th row lists prime factors of 2^n - 1 (n >= 2), without repetition.
- Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), without repetition.A060444
Table T(n,k) in which n-th row lists prime factors of 2^n + 1 (n >= 0), without repetition.
- "Dropping time" in 3x+1 problem starting at 2n+1 (number of steps to reach a lower number than starting value). Also called glide(2n+1).A060445
"Dropping time" in 3x+1 problem starting at 2n+1 (number of steps to reach a lower number than starting value). Also called glide(2n+1).
- Number of ways to color vertices of a pentagon using <= n colors, allowing rotations and reflections.A060446
Number of ways to color vertices of a pentagon using <= n colors, allowing rotations and reflections.
- Cyclic token-passing numbers with pattern 121: players 1, 2, ..., n are seated around a table. Each has a penny. Player 1 passes a penny to player 2, who passes two pennies to player 3, who passes a penny to player 4. Player 4 passes a penny to player 5, who passes two pennies to player 6, who passes a penny to player 7 and so on, players passing 1,2,1,1,2,1,... pennies to the next player who still has some pennies. A player who runs out of pennies drops out of the game and leaves the table. Sequence gives number of players remaining when game reaches periodic state.A060447
Cyclic token-passing numbers with pattern 121: players 1, 2, ..., n are seated around a table. Each has a penny. Player 1 passes a penny to player 2, who passes two pennies to player 3, who passes a penny to player 4. Player 4 passes a penny to player 5, who passes two pennies to player 6, who passes a penny to player 7 and so on, players passing 1,2,1,1,2,1,... pennies to the next player who still has some pennies. A player who runs out of pennies drops out of the game and leaves the table. Sequence gives number of players remaining when game reaches periodic state.
- Each c(i) is "multiply" (*) or "divide" (/); d(1) = 1 < d(2) < ... < d(m) = n are the divisors of n; a(n) is number of choices for c(1), ..., c(m-1) so that d(1) c(1) d(2) c(2) d(3), .., c(m-1) d(m) is an integer.A060448
Each c(i) is "multiply" (*) or "divide" (/); d(1) = 1 < d(2) < ... < d(m) = n are the divisors of n; a(n) is number of choices for c(1), ..., c(m-1) so that d(1) c(1) d(2) c(2) d(3), .., c(m-1) d(m) is an integer.
- Generalized Mills numbers: a(n) = floor(c^(b^n)) where c=4.4, b=1.179.A060449
Generalized Mills numbers: a(n) = floor(c^(b^n)) where c=4.4, b=1.179.
- Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code.A060450
Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code.
- Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R.A060451
Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R.
- Let v = (1,4,9,...,n^2), x = (0,1,2,4,6,...) [first n terms of A002620]; a(n) = v.v * x.x - (v.x)^2.A060452
Let v = (1,4,9,...,n^2), x = (0,1,2,4,6,...) [first n terms of A002620]; a(n) = v.v * x.x - (v.x)^2.
- Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).A060453
Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).
- Consider the line segment in R^n from the origin to the point v = (1,4,9,...,n^2); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.A060454
Consider the line segment in R^n from the origin to the point v = (1,4,9,...,n^2); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.
- 7th-order Fibonacci numbers with a(0)=...=a(6)=1.A060455
7th-order Fibonacci numbers with a(0)=...=a(6)=1.
- a(n) = floor(exp(Pi*sqrt(n))).A060456
a(n) = floor(exp(Pi*sqrt(n))).
- Number of solutions to y^2 + y = x^3 - x^2 modulo n.A060457
Number of solutions to y^2 + y = x^3 - x^2 modulo n.
- Maximum value seen in the final n decimal digits of 2^j for all values of j.A060458
Maximum value seen in the final n decimal digits of 2^j for all values of j.
- a(n) = (n*(n+1))^3.A060459
a(n) = (n*(n+1))^3.
- Consider the final n decimal digits of 2^j for all values of j. They are periodic. Sequence gives position (or phase) of the maximal value seen in these n digits.A060460
Consider the final n decimal digits of 2^j for all values of j. They are periodic. Sequence gives position (or phase) of the maximal value seen in these n digits.