Sequences
392,541 sequences
- a(1) = 11, a(n) = smallest prime obtained by starting with a(n-1) and prefixing it with one or more copies of (the decimal expansion of) n.A088061
a(1) = 11, a(n) = smallest prime obtained by starting with a(n-1) and prefixing it with one or more copies of (the decimal expansion of) n.
- a(1) = 2; thereafter a(n) = smallest number of copies of (the decimal expansion of) n that are needed to prefix A088061(n-1) with in order to get a prime (the prime being A088061(n)).A088062
a(1) = 2; thereafter a(n) = smallest number of copies of (the decimal expansion of) n that are needed to prefix A088061(n-1) with in order to get a prime (the prime being A088061(n)).
- a(1) = 1, a(n) = smallest square obtained by prefixing a multiple of n to a(n-1).A088063
a(1) = 1, a(n) = smallest square obtained by prefixing a multiple of n to a(n-1).
- a(1)= 9, a(n) =smallest square obtained by prefixing a multiple of n to a(n-1).A088064
a(1)= 9, a(n) =smallest square obtained by prefixing a multiple of n to a(n-1).
- a(1)= 4, a(n) =smallest square obtained by prefixing a multiple of n to a(n-1).A088065
a(1)= 4, a(n) =smallest square obtained by prefixing a multiple of n to a(n-1).
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.A088066
Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.
- Smallest n-th power sandwiched between two numbers divisible by an n-th power.A088067
Smallest n-th power sandwiched between two numbers divisible by an n-th power.
- Squares sandwiched between two numbers divisible by squares.A088068
Squares sandwiched between two numbers divisible by squares.
- Cubes sandwiched between two numbers divisible by cubes > 1.A088069
Cubes sandwiched between two numbers divisible by cubes > 1.
- Numbers sandwiched between two numbers having the same number of prime divisors.A088070
Numbers sandwiched between two numbers having the same number of prime divisors.
- Number sandwiched between two numbers having only one prime divisor.A088071
Number sandwiched between two numbers having only one prime divisor.
- Numbers sandwiched between two numbers having only one prime divisor (at least) one of which is composite.A088072
Numbers sandwiched between two numbers having only one prime divisor (at least) one of which is composite.
- Beginning with 11 (concatenation of 1 twice), smallest number which is a concatenation of itself as many (say k) times required, chosen from odd numbers not == 5 (mod 10), in natural order, so that every partial concatenation is prime.A088073
Beginning with 11 (concatenation of 1 twice), smallest number which is a concatenation of itself as many (say k) times required, chosen from odd numbers not == 5 (mod 10), in natural order, so that every partial concatenation is prime.
- Number of times A045572(n) is concatenated with itself in A088073.A088074
Number of times A045572(n) is concatenated with itself in A088073.
- Smallest number sandwiched between two numbers having exactly n prime divisors.A088075
Smallest number sandwiched between two numbers having exactly n prime divisors.
- Smallest prime sandwiched between two numbers having exactly n prime divisors.A088076
Smallest prime sandwiched between two numbers having exactly n prime divisors.
- a(n) is the least number m sandwiched between m-1 and m+1, both with special properties as follows: both are squarefree; both have n distinct prime factors.A088077
a(n) is the least number m sandwiched between m-1 and m+1, both with special properties as follows: both are squarefree; both have n distinct prime factors.
- Leading column of triangle defined in A088079.A088078
Leading column of triangle defined in A088079.
- Diagonal T(n,n) of the triangle T(n,k), n>=0, 0<=k<=n, in which row n contains n+1 consecutive integers T(n,k+1)=T(n,k)+1 such that T(n,k) is divisible by a k-th power.A088079
Diagonal T(n,n) of the triangle T(n,k), n>=0, 0<=k<=n, in which row n contains n+1 consecutive integers T(n,k+1)=T(n,k)+1 such that T(n,k) is divisible by a k-th power.
- Start of n successive numbers divisible by n-th powers.A088080
Start of n successive numbers divisible by n-th powers.
- Smallest prime(k) such that for every r = 1 to n, there exist i,j, k >= j > i, such that prime(j)-prime(i) == 0 ( mod r).A088081
Smallest prime(k) such that for every r = 1 to n, there exist i,j, k >= j > i, such that prime(j)-prime(i) == 0 ( mod r).
- Indices n of terms in A088081 such that a(n+1) > a(n).A088082
Indices n of terms in A088081 such that a(n+1) > a(n).
- Primes p which are members of A088081. a(n) = A088081(A088082(n-1) +1).A088083
Primes p which are members of A088081. a(n) = A088081(A088082(n-1) +1).
- a(1) = 2; then least palindrome greater than the previous term such that every partial concatenation is a prime.A088084
a(1) = 2; then least palindrome greater than the previous term such that every partial concatenation is a prime.
- Primes arising in A088084.A088085
Primes arising in A088084.
- a(1) = 2; then smallest palindrome > 1 not occurring earlier such that every partial concatenation is a prime.A088086
a(1) = 2; then smallest palindrome > 1 not occurring earlier such that every partial concatenation is a prime.
- Primes arising in A088086.A088087
Primes arising in A088086.
- a(1) = 1, a(n) = smallest multiple of a(n-1) such that every partial concatenation (n >1) is a prime.A088088
a(1) = 1, a(n) = smallest multiple of a(n-1) such that every partial concatenation (n >1) is a prime.
- Primes arising in A088088.A088089
Primes arising in A088088.
- For n > 1, a(n) is the smallest number such that n-th concatenation is prime and the smallest palindrome beginning with (but not equal to) this concatenation is also prime.A088090
For n > 1, a(n) is the smallest number such that n-th concatenation is prime and the smallest palindrome beginning with (but not equal to) this concatenation is also prime.
- Primes p such that the smallest palindrome beginning with p with odd number of digits is also a palindrome.A088091
Primes p such that the smallest palindrome beginning with p with odd number of digits is also a palindrome.
- Palindromic primes p such that if each digit d is replaced by 10-d then the resulting palindrome is also a prime.A088092
Palindromic primes p such that if each digit d is replaced by 10-d then the resulting palindrome is also a prime.
- Beginning with 2, smallest palindrome >= the previous term such that every concatenation is a prime.A088093
Beginning with 2, smallest palindrome >= the previous term such that every concatenation is a prime.
- Primes arising in A088093.A088094
Primes arising in A088093.
- a(1) = 1, a(n) = smallest number == 1 mod (a(n-1)) and > 1 such that every concatenation (n>1) is prime.A088095
a(1) = 1, a(n) = smallest number == 1 mod (a(n-1)) and > 1 such that every concatenation (n>1) is prime.
- Primes arising in A088095.A088096
Primes arising in A088095.
- a(1) = 3, a(n) > 1 is the smallest number == 1 mod (a(n-1)) such that every concatenation is prime.A088097
a(1) = 3, a(n) > 1 is the smallest number == 1 mod (a(n-1)) such that every concatenation is prime.
- Primes arising in A088097.A088098
Primes arising in A088097.
- Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n: (1, 2), (3, 4, 5), (6, 7, 8), (9, 10, 11, 12, 13, 14, 15), (16, 17, 18, 19), (20, 21, 22, 23, 24, 25, 26, 27, 28), (29, 30, 31, 32, 33, 34), ... Sequence contains the group sums.A088099
Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n: (1, 2), (3, 4, 5), (6, 7, 8), (9, 10, 11, 12, 13, 14, 15), (16, 17, 18, 19), (20, 21, 22, 23, 24, 25, 26, 27, 28), (29, 30, 31, 32, 33, 34), ... Sequence contains the group sums.
- Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n. (1,2),(3,4,5,),(6,7,8),(9,10,11,12,13,14,15),(16,17,18,19),(20,21,22,23,24,25,26,27,28),(29,30,31,32,33,34),... Sequence contains the number of members in the n-th group.A088100
Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n. (1,2),(3,4,5,),(6,7,8),(9,10,11,12,13,14,15),(16,17,18,19),(20,21,22,23,24,25,26,27,28),(29,30,31,32,33,34),... Sequence contains the number of members in the n-th group.
- Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n. (1,2),(3,4,5,),(6,7,8),(9,10,11,12,13,14,15),(16,17,18,19),(20,21,22,23,24,25,26,27,28),(29,30,31,32,33,34),... Sequence contains the n-th group sum divided by n.A088101
Group the natural numbers with at least two members in each group such that the n-th group sum is a multiple of n. (1,2),(3,4,5,),(6,7,8),(9,10,11,12,13,14,15),(16,17,18,19),(20,21,22,23,24,25,26,27,28),(29,30,31,32,33,34),... Sequence contains the n-th group sum divided by n.
- a(1) = 3, a(n) = smallest palindromic prime beginning with a(n-1).A088102
a(1) = 3, a(n) = smallest palindromic prime beginning with a(n-1).
- a(1) = 11; for n>1, a(n) = smallest palindromic prime beginning with a(n-1).A088103
a(1) = 11; for n>1, a(n) = smallest palindromic prime beginning with a(n-1).
- Smallest n-digit prime beginning with prime(n), or 0 if no such prime exists.A088104
Smallest n-digit prime beginning with prime(n), or 0 if no such prime exists.
- a(n) = smallest n-digit prime beginning with prime(n)- smallest n-digit number beginning with prime(n).A088105
a(n) = smallest n-digit prime beginning with prime(n)- smallest n-digit number beginning with prime(n).
- Smallest prime == 1 (mod (product of next n numbers)).A088106
Smallest prime == 1 (mod (product of next n numbers)).
- Smallest prime == 1 (mod (least common multiple of next n numbers)).A088107
Smallest prime == 1 (mod (least common multiple of next n numbers)).
- a(1)=1, a(n) = least odd triangular number which is a proper multiple of a(n-1).A088108
a(1)=1, a(n) = least odd triangular number which is a proper multiple of a(n-1).
- a(1)=1, a(n)= least odd triangular number which is a proper multiple of a(n-1) with a multiplier different from the ones used earlier.A088109
a(1)=1, a(n)= least odd triangular number which is a proper multiple of a(n-1) with a multiplier different from the ones used earlier.
- Numbers n such that 2^n + n and 2^n - n are noncomposite.A088110
Numbers n such that 2^n + n and 2^n - n are noncomposite.