Sequences
392,541 sequences
- a(n) = { Smallest prime > k } - k, where k = lcm(1..n).A060361
a(n) = { Smallest prime > k } - k, where k = lcm(1..n).
- a(n) = Min { { smallest prime > k } - k, k - { largest prime < k } }, where k = lcm(1..n) = A003418(n).A060362
a(n) = Min { { smallest prime > k } - k, k - { largest prime < k } }, where k = lcm(1..n) = A003418(n).
- Smallest prime p such that first n primes (p_1=2, ..., p_n) are 13th power residues mod p.A060363
Smallest prime p such that first n primes (p_1=2, ..., p_n) are 13th power residues mod p.
- Smallest prime p such that first n primes (p_1=2, ..., p_n) are 17th power residues mod p.A060364
Smallest prime p such that first n primes (p_1=2, ..., p_n) are 17th power residues mod p.
- Multiples of one thousand which are described by single words in American English.A060365
Multiples of one thousand which are described by single words in American English.
- Powers of one thousand which are described by single words in dated British English usage, extended by using "-ard" beyond 10^9.A060366
Powers of one thousand which are described by single words in dated British English usage, extended by using "-ard" beyond 10^9.
- Average order of an element in a cyclic group of order n rounded down.A060367
Average order of an element in a cyclic group of order n rounded down.
- Number of irreducible representations of the symmetric group S_n that have even degree.A060368
Number of irreducible representations of the symmetric group S_n that have even degree.
- a(n) is the maximum number of occurrences of a degree in the sequence of the degrees of the irreducible representations of the symmetric group S_n.A060369
a(n) is the maximum number of occurrences of a degree in the sequence of the degrees of the irreducible representations of the symmetric group S_n.
- Ratios (p-1)/d, where p is a prime and d is the number of digits of the periodic part of the decimal expansion of 1/p.A060370
Ratios (p-1)/d, where p is a prime and d is the number of digits of the periodic part of the decimal expansion of 1/p.
- a(n) = (prime(n) - 1)! + 1.A060371
a(n) = (prime(n) - 1)! + 1.
- p(n), positive part of n when n=p(n)-q(n) with p(n), q(n), p(n)+q(n) in A005836, integers written without 2 in base 3.A060372
p(n), positive part of n when n=p(n)-q(n) with p(n), q(n), p(n)+q(n) in A005836, integers written without 2 in base 3.
- q(n), negative part of n when n=p(n)-q(n) with p(n), q(n), p(n)+q(n) in A005836, integers written without 2 in base 3.A060373
q(n), negative part of n when n=p(n)-q(n) with p(n), q(n), p(n)+q(n) in A005836, integers written without 2 in base 3.
- a(n)=p+q, where n=p-q and p, q, p+q are in A005836 (integers written without 2 in base 3).A060374
a(n)=p+q, where n=p-q and p, q, p+q are in A005836 (integers written without 2 in base 3).
- a(n) = (n+2)^(n+3) - n^(n+1).A060375
a(n) = (n+2)^(n+3) - n^(n+1).
- If 10^n can be written as x*y where the digits of x and y are all nonzero, then let a(n) = smallest such x, otherwise a(n) = -1.A060376
If 10^n can be written as x*y where the digits of x and y are all nonzero, then let a(n) = smallest such x, otherwise a(n) = -1.
- Pepin's test numbers.A060377
Pepin's test numbers.
- Even-odd sieve.A060378
Even-odd sieve.
- Number of self-avoiding polygons on the 2-dimensional square lattice with perimeter 2n with at most 4 horizontal edges in each vertical cross-section.A060379
Number of self-avoiding polygons on the 2-dimensional square lattice with perimeter 2n with at most 4 horizontal edges in each vertical cross-section.
- Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.A060380
Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.
- a(n) = prime(n)*prime(n+1)*...*prime(2*n-1), where prime(i) is the i-th prime.A060381
a(n) = prime(n)*prime(n+1)*...*prime(2*n-1), where prime(i) is the i-th prime.
- In base n, a(n) is the smallest number m that leads to a palindrome-free sequence, using the following process: start with m; reverse the digits and add it to m, repeat. Stop if you reach a palindrome.A060382
In base n, a(n) is the smallest number m that leads to a palindrome-free sequence, using the following process: start with m; reverse the digits and add it to m, repeat. Stop if you reach a palindrome.
- a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number.A060383
a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number.
- Number of decimal digits in n-th Fibonacci number.A060384
Number of decimal digits in n-th Fibonacci number.
- Largest prime factor of n-th Fibonacci number.A060385
Largest prime factor of n-th Fibonacci number.
- In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using primes and each time choosing the smallest prime that will give the desired digit.A060386
In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using primes and each time choosing the smallest prime that will give the desired digit.
- Numbers k such that x^4 + y^4 = k * z^4 is solvable in nonzero integers x,y,z.A060387
Numbers k such that x^4 + y^4 = k * z^4 is solvable in nonzero integers x,y,z.
- Decimal expansion of alpha(2) = Sum_{i>0} prime(i)*2^(-i^2).A060388
Decimal expansion of alpha(2) = Sum_{i>0} prime(i)*2^(-i^2).
- a(1)=p_1, a(2)=p_1 + p_1*p_2, a(3)=p_1 + p_1*p_2 + p_1*p_2*p_3, ... where p_i is the i-th prime.A060389
a(1)=p_1, a(2)=p_1 + p_1*p_2, a(3)=p_1 + p_1*p_2 + p_1*p_2*p_3, ... where p_i is the i-th prime.
- Fibonacci sieve: using Fibonacci numbers, strike out every 2nd, 3rd, 5th, 8th, 13th, 21st, 34th... of those remaining.A060390
Fibonacci sieve: using Fibonacci numbers, strike out every 2nd, 3rd, 5th, 8th, 13th, 21st, 34th... of those remaining.
- If 10^n can be written as x*y where the digits of x and y are all nonzero, then let a(n) = largest such y, otherwise a(n) = -1.A060391
If 10^n can be written as x*y where the digits of x and y are all nonzero, then let a(n) = largest such y, otherwise a(n) = -1.
- Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.A060392
Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.
- Values of k associated with A060380.A060393
Values of k associated with A060380.
- Values of k associated with A060392.A060394
Values of k associated with A060392.
- Smallest prime that divides k^2 + k + n for k = 0, 1, 2, ....A060395
Smallest prime that divides k^2 + k + n for k = 0, 1, 2, ....
- Values of k associated with A060395.A060396
Values of k associated with A060395.
- Smallest prime that divides k^2 + k + 2n + 1 for k = 0,1,2,....A060397
Smallest prime that divides k^2 + k + 2n + 1 for k = 0,1,2,....
- Values of k associated with A060397.A060398
Values of k associated with A060397.
- In base ten, we try to get the digits 1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.A060399
In base ten, we try to get the digits 1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.
- In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.A060400
In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.
- a(n) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1.A060401
a(n) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1.
- Continued fraction expansion of tanh(Pi).A060402
Continued fraction expansion of tanh(Pi).
- Each term is the previous term plus the number of letters in the previous number, as conventionally spelled out in American English.A060403
Each term is the previous term plus the number of letters in the previous number, as conventionally spelled out in American English.
- G.f.: Sum_{k >= 1} (phi(k)/k)*log(1-f(x^k)), where f(x) = (1 - sqrt(1 - 4*x)) / (2*x) - 1 is the g.f. for the Catalan numbers (A000108) C_1, C_2, C_3, ...A060404
G.f.: Sum_{k >= 1} (phi(k)/k)*log(1-f(x^k)), where f(x) = (1 - sqrt(1 - 4*x)) / (2*x) - 1 is the g.f. for the Catalan numbers (A000108) C_1, C_2, C_3, ...
- Sum of n-th Lucas number (A000032(n)) and n-th Pell number (A000129(n)).A060405
Sum of n-th Lucas number (A000032(n)) and n-th Pell number (A000129(n)).
- Duplicate of A001839.A060406
Duplicate of A001839.
- Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.A060407
Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.
- Triangle T(n,k) in which n-th row gives numbers of super edge-magic labelings of (n,k)-graphs, for n >= 2, and 1 <= k <= 2n-3.A060408
Triangle T(n,k) in which n-th row gives numbers of super edge-magic labelings of (n,k)-graphs, for n >= 2, and 1 <= k <= 2n-3.
- 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 associated "dropping time", number of steps to reach a lower value than the start.A060409
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 associated "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 highest point of the trajectory before reaching 1 (A006884); sequence gives associated maximal value reached in the trajectory with that start.A060410
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 associated maximal value reached in the trajectory with that start.