Sequences
392,541 sequences
- a(n) = lcm(4n, A025586(4n)), least common multiple of 4n and the largest value in 3x+1 iteration list started at 4n.A087261
a(n) = lcm(4n, A025586(4n)), least common multiple of 4n and the largest value in 3x+1 iteration list started at 4n.
- Integer quotient of largest and initial values in 3x+1 iteration, started at n.A087262
Integer quotient of largest and initial values in 3x+1 iteration, started at n.
- a(n) is the least initial value of a 3x+1 trajectory in which n is the largest (peak) term or a(n) = 0 if n cannot be a peak value (i.e., when n = 2k+1, n = 4k+2, n = 16k+12, etc.).A087263
a(n) is the least initial value of a 3x+1 trajectory in which n is the largest (peak) term or a(n) = 0 if n cannot be a peak value (i.e., when n = 2k+1, n = 4k+2, n = 16k+12, etc.).
- a(n) is the least initial value of a 3x+1 trajectory in which 4n is the largest(peak) term or a(n)=0 if 4n cannot be a peak.A087264
a(n) is the least initial value of a 3x+1 trajectory in which 4n is the largest(peak) term or a(n)=0 if 4n cannot be a peak.
- Lucas numbers L(8*n).A087265
Lucas numbers L(8*n).
- a(n) = gcd(2^n, pi(2^n)) = gcd(A000079(n), A007053(n)).A087266
a(n) = gcd(2^n, pi(2^n)) = gcd(A000079(n), A007053(n)).
- a(n) = gcd(n, pi(n)) where pi is A000720.A087267
a(n) = gcd(n, pi(n)) where pi is A000720.
- Solutions to gcd(x, pi(x)) = 1, where pi is A000720.A087268
Solutions to gcd(x, pi(x)) = 1, where pi is A000720.
- Nonprime solutions to gcd(x, pi(x)) = gcd(x, A000720(x)) = 1.A087269
Nonprime solutions to gcd(x, pi(x)) = gcd(x, A000720(x)) = 1.
- Solutions to gcd(x,pi(x)) = gcd(x, A000720(x)) > 1. Numbers x such that x and pi(x) have common divisor larger than one.A087270
Solutions to gcd(x,pi(x)) = gcd(x, A000720(x)) > 1. Numbers x such that x and pi(x) have common divisor larger than one.
- Least number x such that gcd(x, pi(x)) = n.A087271
Least number x such that gcd(x, pi(x)) = n.
- a(n) is the largest prime number in 3x+1 trajectory initiated at n.A087272
a(n) is the largest prime number in 3x+1 trajectory initiated at n.
- Largest prime factor of 3*prime(n) + 1.A087273
Largest prime factor of 3*prime(n) + 1.
- Prime index of the largest prime factor of 3*prime(n)+1.A087274
Prime index of the largest prime factor of 3*prime(n)+1.
- Write n in binary: 1ab..yz, then a(n) = 1b..yz + ... + 1yz + 1z + 1.A087275
Write n in binary: 1ab..yz, then a(n) = 1b..yz + ... + 1yz + 1z + 1.
- Write n in binary: 1ab..yz, then a(n) = 1ab..yz + ... + 1yz + 1z + 1.A087276
Write n in binary: 1ab..yz, then a(n) = 1ab..yz + ... + 1yz + 1z + 1.
- Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.A087277
Numbers k such that the three second-degree cyclotomic polynomials x^2 + 1, x^2 - x + 1 and x^2 + x + 1 are simultaneously prime when evaluated at x=k.
- Nonnegative integers whose distance to the nearest square is not greater than 1.A087278
Nonnegative integers whose distance to the nearest square is not greater than 1.
- Nonnegative numbers whose distance to the nearest positive square equals exactly 1.A087279
Nonnegative numbers whose distance to the nearest positive square equals exactly 1.
- Solutions n of max(m+d(m))=n+2 for m<n; d(m) is the number of divisors of m.A087280
Solutions n of max(m+d(m))=n+2 for m<n; d(m) is the number of divisors of m.
- a(n) = Lucas(7*n).A087281
a(n) = Lucas(7*n).
- An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).A087282
An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).
- An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).A087283
An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).
- An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).A087284
An infinite audioactive word, one of three in the cycle that results from the limit of the 'Look and Say' sequence using method A with an initial term of 1 (A005150).
- Possible differences between a cube and the next smaller square.A087285
Possible differences between a cube and the next smaller square.
- Possible differences between a square and the closest smaller cube.A087286
Possible differences between a square and the closest smaller cube.
- a(n) = Lucas(9*n).A087287
a(n) = Lucas(9*n).
- a(n)=2a(n-1)+a(n-2)-2a(n-3).A087288
a(n)=2a(n-1)+a(n-2)-2a(n-3).
- a(n) = 2^(2*n+1) + 1.A087289
a(n) = 2^(2*n+1) + 1.
- Number of pairs of polynomials (f,g) in GF(3)[x] satisfying deg(f) <= n, deg(g) <= n and gcd(f,g) = 1.A087290
Number of pairs of polynomials (f,g) in GF(3)[x] satisfying deg(f) <= n, deg(g) <= n and gcd(f,g) = 1.
- Number of pairs of polynomials (f,g) in GF(2)[x] satisfying 1 <= deg(f) <= n, 1 <= deg(g) <= n and gcd(f,g) = 1.A087291
Number of pairs of polynomials (f,g) in GF(2)[x] satisfying 1 <= deg(f) <= n, 1 <= deg(g) <= n and gcd(f,g) = 1.
- Number of pairs of polynomials (f,g) in GF(3)[x] satisfying 1 <= deg(f) < =n, 1 <= deg(g) <= n and gcd(f,g) = 1.A087292
Number of pairs of polynomials (f,g) in GF(3)[x] satisfying 1 <= deg(f) < =n, 1 <= deg(g) <= n and gcd(f,g) = 1.
- Numbers k such that ((prime(k)*prime(k+1))^2 + 1)/2 is prime.A087293
Numbers k such that ((prime(k)*prime(k+1))^2 + 1)/2 is prime.
- Primes resulting from A087293.A087294
Primes resulting from A087293.
- Successive remainders when computing the Euclidean algorithm for (n,m) where m is any positive integer having no common factor with n, gives a list ending with a sublist of Fibonacci sequence. Find m such that this sublist has the greatest length and define a(n) as this length.A087295
Successive remainders when computing the Euclidean algorithm for (n,m) where m is any positive integer having no common factor with n, gives a list ending with a sublist of Fibonacci sequence. Find m such that this sublist has the greatest length and define a(n) as this length.
- Duplicate of A065731.A087296
Duplicate of A065731.
- Add the next prime and multiply by the next prime.A087297
Add the next prime and multiply by the next prime.
- Exponent of 2 in the prime factorization of (3n)!.A087298
Exponent of 2 in the prime factorization of (3n)!.
- Ratio of volume of n-dimensional ball to circumscribing n-cube is Pi^floor(n/2) divided by a(n).A087299
Ratio of volume of n-dimensional ball to circumscribing n-cube is Pi^floor(n/2) divided by a(n).
- Duplicate of A074455.A087300
Duplicate of A074455.
- a(n) = n!*Sum_{i=1..n-1} (-1)^(i+1)/i.A087301
a(n) = n!*Sum_{i=1..n-1} (-1)^(i+1)/i.
- Smallest nontrivial multiple of n whose digit sum is a multiple of digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n or a concatenation of n with itself.A087302
Smallest nontrivial multiple of n whose digit sum is a multiple of digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n or a concatenation of n with itself.
- Smallest nontrivial multiple of n whose digit sum is the same as that of the digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.A087303
Smallest nontrivial multiple of n whose digit sum is the same as that of the digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.
- Smallest nontrivial multiple of n whose nonzero digit product is the same as that of the nonzero digit product of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.A087304
Smallest nontrivial multiple of n whose nonzero digit product is the same as that of the nonzero digit product of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.
- Smallest n-digit non-palindromic number such that it and its digit reversal have the same prime signature.A087305
Smallest n-digit non-palindromic number such that it and its digit reversal have the same prime signature.
- a(n) is the start of the first arithmetic progression with common difference n of n numbers with the same prime signature.A087306
a(n) is the start of the first arithmetic progression with common difference n of n numbers with the same prime signature.
- Triangle read by rows: n-th row is the first arithmetic progression with common difference n of n numbers with the same prime signature.A087307
Triangle read by rows: n-th row is the first arithmetic progression with common difference n of n numbers with the same prime signature.
- Initial terms associated with the arithmetic progressions in A086786.A087308
Initial terms associated with the arithmetic progressions in A086786.
- Least number that ends an arithmetic progression of n numbers with the same prime signature.A087309
Least number that ends an arithmetic progression of n numbers with the same prime signature.
- Common differences of arithmetic progressions in A086786.A087310
Common differences of arithmetic progressions in A086786.