Sequences
392,541 sequences
- Numbers k such that m*2^k - 1 is nonprime for all coefficients m in the range 0 <= m <= k.A061411
Numbers k such that m*2^k - 1 is nonprime for all coefficients m in the range 0 <= m <= k.
- Numbers k such that m*2^k + 1 is prime for exactly one coefficient m in the range 0 <= m <= k.A061412
Numbers k such that m*2^k + 1 is prime for exactly one coefficient m in the range 0 <= m <= k.
- Coefficient values m resulting from A061412.A061413
Coefficient values m resulting from A061412.
- Numbers k such that m*2^k - 1 is prime for exactly one coefficient m in the range 0 <= m <= k.A061414
Numbers k such that m*2^k - 1 is prime for exactly one coefficient m in the range 0 <= m <= k.
- Coefficient values m resulting from A061414.A061415
Coefficient values m resulting from A061414.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the pair of ratios 11/8 and 16/11 which generate two complementary musical tones.A061416
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the pair of ratios 11/8 and 16/11 which generate two complementary musical tones.
- Number of permutations up to cyclic rotations; permutation siteswap necklaces.A061417
Number of permutations up to cyclic rotations; permutation siteswap necklaces.
- a(n) = floor(a(n-1)*3/2) with a(1) = 2.A061418
a(n) = floor(a(n-1)*3/2) with a(1) = 2.
- a(n) = ceiling(a(n-1)*3/2) with a(1) = 1.A061419
a(n) = ceiling(a(n-1)*3/2) with a(1) = 1.
- a(n) = a(ceiling((n-1)*2/3)) + 1 with a(0) = 0.A061420
a(n) = a(ceiling((n-1)*2/3)) + 1 with a(0) = 0.
- Primes of the form 2^k + k + 1.A061421
Primes of the form 2^k + k + 1.
- Numbers k such that 2^(k-1) + k is prime.A061422
Numbers k such that 2^(k-1) + k is prime.
- Sum of digits = 6 times number of digits.A061423
Sum of digits = 6 times number of digits.
- Sum of digits = 7 times number of digits.A061424
Sum of digits = 7 times number of digits.
- Sum of digits = 8 times number of digits.A061425
Sum of digits = 8 times number of digits.
- Geometric mean of the digits = 2. In other words, the product of the digits is = 2^k where k is the number of digits.A061426
Geometric mean of the digits = 2. In other words, the product of the digits is = 2^k where k is the number of digits.
- Geometric mean of the digits = 3. In other words, the product of the digits is = 3^k where k is the number of digits.A061427
Geometric mean of the digits = 3. In other words, the product of the digits is = 3^k where k is the number of digits.
- Geometric mean of the digits = 4. In other words, the product of the digits is = 4^k where k is the number of digits.A061428
Geometric mean of the digits = 4. In other words, the product of the digits is = 4^k where k is the number of digits.
- Geometric mean of the digits = 6. In other words, the product of the digits is = 6^k where k is the number of digits.A061429
Geometric mean of the digits = 6. In other words, the product of the digits is = 6^k where k is the number of digits.
- Geometric mean of the digits is an integer: k-digit numbers such that the product of the digits is a number of the form m^k.A061430
Geometric mean of the digits is an integer: k-digit numbers such that the product of the digits is a number of the form m^k.
- a(n) = LCM of the n consecutive numbers n(n-1)/2 + 1, ..., n(n+1)/2.A061431
a(n) = LCM of the n consecutive numbers n(n-1)/2 + 1, ..., n(n+1)/2.
- a(n) = smallest n-digit square.A061432
a(n) = smallest n-digit square.
- Largest n-digit square.A061433
Largest n-digit square.
- a(n) is the smallest n-digit cube.A061434
a(n) is the smallest n-digit cube.
- a(n) is the largest n-digit cube.A061435
a(n) is the largest n-digit cube.
- Number of steps for trajectory of n to reach 1 under the map that sends x -> x/3 if x mod 3 = 0, x -> x+3-(x mod 3) if x is not 0 mod 3 (for a 2nd time when n starts at 1).A061436
Number of steps for trajectory of n to reach 1 under the map that sends x -> x/3 if x mod 3 = 0, x -> x+3-(x mod 3) if x is not 0 mod 3 (for a 2nd time when n starts at 1).
- Numbers n such that n+1 divides prime(n)+1.A061437
Numbers n such that n+1 divides prime(n)+1.
- Number of steps for trajectory of n to reach 1 under the map that sends x -> x/13 if x mod 13 = 0, x -> 14x+13-(x mod 13) if x is not 0 mod 13 (for a 2nd time when n starts at 1).A061438
Number of steps for trajectory of n to reach 1 under the map that sends x -> x/13 if x mod 13 = 0, x -> 14x+13-(x mod 13) if x is not 0 mod 13 (for a 2nd time when n starts at 1).
- Largest number whose cube has n digits.A061439
Largest number whose cube has n digits.
- Denominators in the series for Bessel function J9(x).A061440
Denominators in the series for Bessel function J9(x).
- Denominators in the series for Bessel function J10(x).A061441
Denominators in the series for Bessel function J10(x).
- Numbers k such that the Lucas Aurifeuillian primitive part A of Lucas(k) is prime.A061442
Numbers k such that the Lucas Aurifeuillian primitive part A of Lucas(k) is prime.
- Numbers k such that the Lucas Aurifeuillian primitive part B of Lucas(k) is prime.A061443
Numbers k such that the Lucas Aurifeuillian primitive part B of Lucas(k) is prime.
- Decimal expansion of log(2 * Pi).A061444
Decimal expansion of log(2 * Pi).
- Composite numbers n such that primitive part of Lucas(n) (see A061447) is prime.A061445
Composite numbers n such that primitive part of Lucas(n) (see A061447) is prime.
- Primitive part of Fibonacci(n).A061446
Primitive part of Fibonacci(n).
- Primitive part of Lucas(n).A061447
Primitive part of Lucas(n).
- a(1) = 2; a(n+1) = smallest prime > a(n) with leading digit equal to final digit of a(n).A061448
a(1) = 2; a(n+1) = smallest prime > a(n) with leading digit equal to final digit of a(n).
- a(1) = 1; a(n+1) = smallest square > a(n) with leading digit equal to final digit of a(n) and final digit not 0.A061449
a(1) = 1; a(n+1) = smallest square > a(n) with leading digit equal to final digit of a(n) and final digit not 0.
- a(1) = 1; a(n+1) = smallest cube > a(n) with leading digit equal to final digit of a(n) and final digit not 0.A061450
a(1) = 1; a(n+1) = smallest cube > a(n) with leading digit equal to final digit of a(n) and final digit not 0.
- Array T(n,k) of k-th order Fibonacci numbers read by antidiagonals in up-direction.A061451
Array T(n,k) of k-th order Fibonacci numbers read by antidiagonals in up-direction.
- n*bigomega(n)^n, where bigomega(n) is the number of prime divisors of n, counted with multiplicity.A061452
n*bigomega(n)^n, where bigomega(n) is the number of prime divisors of n, counted with multiplicity.
- a(n) = numerator of the continued fraction [1; 2^2, 3^3, ..., n^n].A061453
a(n) = numerator of the continued fraction [1; 2^2, 3^3, ..., n^n].
- a(n) = denominator of the continued fraction [1; 2^2, 3^3, ..., n^n].A061454
a(n) = denominator of the continued fraction [1; 2^2, 3^3, ..., n^n].
- Triangular numbers whose digit reversal is also a triangular number.A061455
Triangular numbers whose digit reversal is also a triangular number.
- Binary representation of a(n) corresponds to "ana"-sequence.A061456
Binary representation of a(n) corresponds to "ana"-sequence.
- Squares whose reversal is also a square.A061457
Squares whose reversal is also a square.
- Cubes whose digit reversal is also a cube.A061458
Cubes whose digit reversal is also a cube.
- Squares which produce squares when the leading digit is moved to the end.A061459
Squares which produce squares when the leading digit is moved to the end.
- Cubes which produce cubes when the leading digit is moved to the end.A061460
Cubes which produce cubes when the leading digit is moved to the end.