Sequences
392,541 sequences
- a(0) = 1; a(n+1) is the largest positive number (of at most two) such that abs(a(n) - a(n+1)) is the smallest prime not occurring earlier as difference of successive terms and a(n) + a(n+1) is composite.A085061
a(0) = 1; a(n+1) is the largest positive number (of at most two) such that abs(a(n) - a(n+1)) is the smallest prime not occurring earlier as difference of successive terms and a(n) + a(n+1) is composite.
- a(n) = A085060(n)/9 - 1/3.A085062
a(n) = A085060(n)/9 - 1/3.
- a(n) is the minimal number k such that n+k and n*k+1 are primes.A085063
a(n) is the minimal number k such that n+k and n*k+1 are primes.
- a(n) = smallest k such that nk-1 as well as n+k are primes.A085064
a(n) = smallest k such that nk-1 as well as n+k are primes.
- a(1) = 4, a(n) = smallest number of the form k*a(n-1) +1 with the same prime signature p^2, where p is a prime.A085065
a(1) = 4, a(n) = smallest number of the form k*a(n-1) +1 with the same prime signature p^2, where p is a prime.
- a(1) = 6, a(n) = smallest number of the form k*a(n-1) +1 with the same prime signature p*q (6 = 2*3), where p and q are primes.A085066
a(1) = 6, a(n) = smallest number of the form k*a(n-1) +1 with the same prime signature p*q (6 = 2*3), where p and q are primes.
- a(1) = 6, a(n) = smallest number of the form k*a(n-1) + 1 with the same number of divisors, i.e., 4.A085067
a(1) = 6, a(n) = smallest number of the form k*a(n-1) + 1 with the same number of divisors, i.e., 4.
- Number of steps >= 1 for iteration of map x -> (4/3)*ceiling(x) to reach an integer when started at n, or -1 if no such integer is ever reached.A085068
Number of steps >= 1 for iteration of map x -> (4/3)*ceiling(x) to reach an integer when started at n, or -1 if no such integer is ever reached.
- a(1) =1, then the smallest number a(n)== 1 ( mod a(n-1)) such that tau(a(n))= n.A085069
a(1) =1, then the smallest number a(n)== 1 ( mod a(n-1)) such that tau(a(n))= n.
- a(1) = 1; then the smallest number a(n) == -1 mod a(n-1) such that tau(a(n)) = n.A085070
a(1) = 1; then the smallest number a(n) == -1 mod a(n-1) such that tau(a(n)) = n.
- Integers reached in A085068.A085071
Integers reached in A085068.
- Smallest k such that n and n+k have the same prime signature.A085072
Smallest k such that n and n+k have the same prime signature.
- Smallest k such that n+k and n*k have the same prime signature, or 0 if no such number exists.A085073
Smallest k such that n+k and n*k have the same prime signature, or 0 if no such number exists.
- Smallest number a(n) == 1 (mod n) such that the prime signature of n and a(n) is the same.A085074
Smallest number a(n) == 1 (mod n) such that the prime signature of n and a(n) is the same.
- Smallest number a(n) == -1 (mod n) such that the prime signature of n and a(n) is the same, or 0 if no such number exists.A085075
Smallest number a(n) == -1 (mod n) such that the prime signature of n and a(n) is the same, or 0 if no such number exists.
- Triangular numbers > 0 with a prime signature that has not occurred earlier.A085076
Triangular numbers > 0 with a prime signature that has not occurred earlier.
- Fibonacci numbers with a prime signature that has not occurred earlier.A085077
Fibonacci numbers with a prime signature that has not occurred earlier.
- The largest number with the prime signature of n! using primes <= n.A085078
The largest number with the prime signature of n! using primes <= n.
- Largest number with the prime signature of n using prime divisors of n.A085079
Largest number with the prime signature of n using prime divisors of n.
- Smallest k such that n, k and n+k have the same prime signature (canonical form), or 0 if no such number exists.A085080
Smallest k such that n, k and n+k have the same prime signature (canonical form), or 0 if no such number exists.
- Group the natural numbers such that the product of the terms of the n-th group has a divisor with the same prime signature as that of the product of the terms of the (n-1)-th group. (1), (2), (3), (4), (5,6,7,8), (9,10,11,12,13,14),... Sequence contains the product of the terms of the groups.A085081
Group the natural numbers such that the product of the terms of the n-th group has a divisor with the same prime signature as that of the product of the terms of the (n-1)-th group. (1), (2), (3), (4), (5,6,7,8), (9,10,11,12,13,14),... Sequence contains the product of the terms of the groups.
- Number of distinct prime signatures arising among the divisors of n.A085082
Number of distinct prime signatures arising among the divisors of n.
- Index of the first occurrence of n in A085082. Smallest number having divisors with n distinct prime signatures.A085083
Index of the first occurrence of n in A085082. Smallest number having divisors with n distinct prime signatures.
- Smallest number not yet used which is not a prime but is relatively prime to the previous term.A085084
Smallest number not yet used which is not a prime but is relatively prime to the previous term.
- Numerator of Sum_{i=2..t} (d(i)/d(i-1)-1), where d(1), ..., d(t) are the divisors of n.A085085
Numerator of Sum_{i=2..t} (d(i)/d(i-1)-1), where d(1), ..., d(t) are the divisors of n.
- a(1) = 1; if n is composite then a(n) = Sum_{i < n, i not prime} a(i), else if n is prime then a(n) = sum_{ j < n, j is a noncomposite} a(j).A085086
a(1) = 1; if n is composite then a(n) = Sum_{i < n, i not prime} a(i), else if n is prime then a(n) = sum_{ j < n, j is a noncomposite} a(j).
- a(1) = 1; for n>1, a(n) = a(n-1)*n if n is prime, a(n) = a(n-1)/n if n is composite dividing a(n-1) else a(n) = a(n-1).A085087
a(1) = 1; for n>1, a(n) = a(n-1)*n if n is prime, a(n) = a(n-1)/n if n is composite dividing a(n-1) else a(n) = a(n-1).
- Duplicate of A073870.A085088
Duplicate of A073870.
- Number of distinct prime signatures arising up to n.A085089
Number of distinct prime signatures arising up to n.
- If 2n-1 is prime then a(n) = 2n-1, otherwise a(n) = 0.A085090
If 2n-1 is prime then a(n) = 2n-1, otherwise a(n) = 0.
- Denominator of Sum_{i=2..t} (d(i)/d(i-1)-1), where d(1), ..., d(t) are the divisors of n.A085091
Denominator of Sum_{i=2..t} (d(i)/d(i-1)-1), where d(1), ..., d(t) are the divisors of n.
- Numerators of constant term in a formal analog of Bernoulli numbers.A085092
Numerators of constant term in a formal analog of Bernoulli numbers.
- Distinct primes and composite numbers alternately such that the sum of a pair of successive terms is prime or composite alternately.A085093
Distinct primes and composite numbers alternately such that the sum of a pair of successive terms is prime or composite alternately.
- Smallest k such that n*k-1 is a palindrome, or 0 if no such number exists.A085094
Smallest k such that n*k-1 is a palindrome, or 0 if no such number exists.
- Index of first occurrence of n in A085094.A085095
Index of first occurrence of n in A085094.
- Index of the first occurrence of n in A082744, or 0 if n does not occur in the sequence A082744.A085096
Index of the first occurrence of n in A082744, or 0 if n does not occur in the sequence A082744.
- Ramanujan sum c_n(3).A085097
Ramanujan sum c_n(3).
- a(n) = number of solutions (x_1, x_2, ..., x_n) to Product_{i=1..n} (1 + 1/x_i) = 2.A085098
a(n) = number of solutions (x_1, x_2, ..., x_n) to Product_{i=1..n} (1 + 1/x_i) = 2.
- Least natural number k such that k^2 + n is prime.A085099
Least natural number k such that k^2 + n is prime.
- Rearrangement of natural numbers such that the sum of n terms beginning with the n-th term is a palindrome. Smallest number not included earlier is given priority.A085100
Rearrangement of natural numbers such that the sum of n terms beginning with the n-th term is a palindrome. Smallest number not included earlier is given priority.
- Palindromes arising in A085100.A085101
Palindromes arising in A085100.
- Go on adding the divisors of n starting from n in decreasing order until one gets a prime. a(n) = this prime, or 0 if no prime is obtained.A085102
Go on adding the divisors of n starting from n in decreasing order until one gets a prime. a(n) = this prime, or 0 if no prime is obtained.
- Indices of zeros in A085102.A085103
Indices of zeros in A085102.
- Primes of the form 1 + n + n^2 + n^3 + ... + n^k, n > 1, k > 1.A085104
Primes of the form 1 + n + n^2 + n^3 + ... + n^k, n > 1, k > 1.
- Starting with prime(n) go on adding smaller primes until one gets a prime. a(n) = this prime, or 0 if no such prime exists.A085105
Starting with prime(n) go on adding smaller primes until one gets a prime. a(n) = this prime, or 0 if no such prime exists.
- Starting with composite(n) go on adding smaller composite numbers until one gets a prime. a(n) = this prime, or 0 if no such prime exists.A085106
Starting with composite(n) go on adding smaller composite numbers until one gets a prime. a(n) = this prime, or 0 if no such prime exists.
- Starting with n-1 go on adding the numbers less than n and coprime to it in descending order until one gets a prime. a(n) = this prime, or 0 if no such number exists.A085107
Starting with n-1 go on adding the numbers less than n and coprime to it in descending order until one gets a prime. a(n) = this prime, or 0 if no such number exists.
- Decimal expansion of sum 1/(p*2^p) where p runs through the set of Artin primes (primes with primitive root 2).A085108
Decimal expansion of sum 1/(p*2^p) where p runs through the set of Artin primes (primes with primitive root 2).
- Palindromes with more than 3 digits in which the absolute difference of a pair of successive digits is identical.A085109
Palindromes with more than 3 digits in which the absolute difference of a pair of successive digits is identical.
- a(1)=1, then add 1 multiply by 2 to get a(2), subtract 1 and multiply by 3 to get a(3), add 1 and multiply by 4 to get a(4) and so on.A085110
a(1)=1, then add 1 multiply by 2 to get a(2), subtract 1 and multiply by 3 to get a(3), add 1 and multiply by 4 to get a(4) and so on.