Sequences
392,541 sequences
- a(1) = 1, a(n) = n-th squarefree number if n is squarefree else a(n) is the n-th nonsquarefree number.A088611
a(1) = 1, a(n) = n-th squarefree number if n is squarefree else a(n) is the n-th nonsquarefree number.
- a(1) = 1, a(n) = n-th squarefree number if n is not squarefree else a(n) is the n-th nonsquarefree number.A088612
a(1) = 1, a(n) = n-th squarefree number if n is not squarefree else a(n) is the n-th nonsquarefree number.
- Smallest nonsquarefree multiple of n.A088613
Smallest nonsquarefree multiple of n.
- Alternate prime and composite numbers not included earlier such that every partial concatenation is a prime: a(2n) is composite and a(2n-1) is prime.A088614
Alternate prime and composite numbers not included earlier such that every partial concatenation is a prime: a(2n) is composite and a(2n-1) is prime.
- Primes arising in A088614.A088615
Primes arising in A088614.
- a(n) = number of n X n (0,1) matrices A such that the 2n vectors consisting of the rows and the columns of the matrix A are all distinct.A088616
a(n) = number of n X n (0,1) matrices A such that the 2n vectors consisting of the rows and the columns of the matrix A are all distinct.
- Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.A088617
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.
- Rearrangement of odd numbers such that every concatenation of at least two terms is composite.A088618
Rearrangement of odd numbers such that every concatenation of at least two terms is composite.
- Numbers k such that the concatenation of 1, k and k^2 is prime.A088619
Numbers k such that the concatenation of 1, k and k^2 is prime.
- Duplicate of A068702.A088620
Duplicate of A068702.
- a(n) = smallest prime which is a concatenation of 1, n, n^2, n^3, ... n^k for some k, or 0 if no such prime exists.A088621
a(n) = smallest prime which is a concatenation of 1, n, n^2, n^3, ... n^k for some k, or 0 if no such prime exists.
- Smallest prime obtained as the concatenation of a power of n followed by a 1, or 0 if no such number exists.A088622
Smallest prime obtained as the concatenation of a power of n followed by a 1, or 0 if no such number exists.
- Prime obtained as the concatenation 1 followed by the smallest power of n, or 0 if no such number exists.A088623
Prime obtained as the concatenation 1 followed by the smallest power of n, or 0 if no such number exists.
- Index of the first occurrence of n in A068696.A088624
Index of the first occurrence of n in A068696.
- a(n) = 14*binomial(n,8).A088625
a(n) = 14*binomial(n,8).
- a(n) = 42*binomial(n,10).A088626
a(n) = 42*binomial(n,10).
- Let 2n = r*s. Then a(n) = number of primes of the form r+s (r= 1 and s = 2n contributes 1 to the count if 2n+1 is prime).A088627
Let 2n = r*s. Then a(n) = number of primes of the form r+s (r= 1 and s = 2n contributes 1 to the count if 2n+1 is prime).
- Smallest prime using all the digits of first n numbers. If necessary, extra digits can be used.A088628
Smallest prime using all the digits of first n numbers. If necessary, extra digits can be used.
- Smallest number k not included earlier such that the concatenation n, k is a prime.A088629
Smallest number k not included earlier such that the concatenation n, k is a prime.
- Members of A088629 such that all the eligible odd numbers less than n have already occurred.A088630
Members of A088629 such that all the eligible odd numbers less than n have already occurred.
- Largest number m < n such that m+n is a prime.A088631
Largest number m < n such that m+n is a prime.
- a(1) = 2; a(n) = smallest number such that the n-th partial concatenation is a multiple of prime(n).A088632
a(1) = 2; a(n) = smallest number such that the n-th partial concatenation is a multiple of prime(n).
- P-n where P = smallest prime > 2n.A088633
P-n where P = smallest prime > 2n.
- Index of the first occurrence of n in A066888.A088634
Index of the first occurrence of n in A066888.
- a(1) = 1, a(n+1) = smallest number such that the product of all numbers between a(n) and a(n+1), ( both excluded) is divisible by n!.A088635
a(1) = 1, a(n+1) = smallest number such that the product of all numbers between a(n) and a(n+1), ( both excluded) is divisible by n!.
- a(1) = 1, a(2n+1) - a(2n) = composite(n), a(2n) - a(2n-1) = prime(n).A088636
a(1) = 1, a(2n+1) - a(2n) = composite(n), a(2n) - a(2n-1) = prime(n).
- a(1) = 1, a(n+1) = a(n) + smallest prime not added earlier if a(n) is noncomposite else a(n+1) = a(n) + the smallest composite number not added earlier.A088637
a(1) = 1, a(n+1) = a(n) + smallest prime not added earlier if a(n) is noncomposite else a(n+1) = a(n) + the smallest composite number not added earlier.
- a(1) = 1, a(n+1) = a(n)+ smallest composite number not added earlier if a(n) is noncomposite else a(n+1) = a(n) + the smallest prime not added earlier.A088638
a(1) = 1, a(n+1) = a(n)+ smallest composite number not added earlier if a(n) is noncomposite else a(n+1) = a(n) + the smallest prime not added earlier.
- Smallest prime beginning with at least n n's (in decimal notation).A088639
Smallest prime beginning with at least n n's (in decimal notation).
- Smallest number suffixed to concatenation of n times n gives a prime.A088640
Smallest number suffixed to concatenation of n times n gives a prime.
- Define f(k) = Floor[k/10]. Smallest prime p such that f(f(f(...r times, (p))))) is a multiple of r+1 for r = 0 to n-1.A088641
Define f(k) = Floor[k/10]. Smallest prime p such that f(f(f(...r times, (p))))) is a multiple of r+1 for r = 0 to n-1.
- If k is a palindrome made of only two nonzero digits a and b then the palindrome arising by swapping the digits a and b.A088642
If k is a palindrome made of only two nonzero digits a and b then the palindrome arising by swapping the digits a and b.
- Triangle read by rows: row n >= 1 is obtained as follows. Start with n, next term is always largest number m with 1 <= m < n which has not yet appeared in that row and such that m + previous term in the row is a prime. Stop when no further m can be found.A088643
Triangle read by rows: row n >= 1 is obtained as follows. Start with n, next term is always largest number m with 1 <= m < n which has not yet appeared in that row and such that m + previous term in the row is a prime. Stop when no further m can be found.
- Smallest n-digit number divisible by n!.A088644
Smallest n-digit number divisible by n!.
- a(n) = A088644(n)/n!.A088645
a(n) = A088644(n)/n!.
- a(0) = 1 and then alternately prime and composite numbers such that the successive difference is (distinct) composite and prime respectively.A088646
a(0) = 1 and then alternately prime and composite numbers such that the successive difference is (distinct) composite and prime respectively.
- a(1) = 1, then the smallest number such that the concatenation a(r), a(s) is prime for all s > r.A088647
a(1) = 1, then the smallest number such that the concatenation a(r), a(s) is prime for all s > r.
- a(1) = 1, then the smallest odd number not occurring earlier such that the concatenation a(r), a(s) is composite for all s > r.A088648
a(1) = 1, then the smallest odd number not occurring earlier such that the concatenation a(r), a(s) is composite for all s > r.
- Duplicate of A020498.A088649
Duplicate of A020498.
- a(n) is the smallest x such that A020498(k) + x is prime for all k = 1 to n.A088650
a(n) is the smallest x such that A020498(k) + x is prime for all k = 1 to n.
- a(n) = smallest number k such that rk-1 is prime for all r = 1 to n.A088651
a(n) = smallest number k such that rk-1 is prime for all r = 1 to n.
- Triangle of primes arising in A088651. The n-th row of the triangle contains set of n primes of the form r*A088651(n)-1 for r = 1 to n. Sequence contains the triangle by rows.A088652
Triangle of primes arising in A088651. The n-th row of the triangle contains set of n primes of the form r*A088651(n)-1 for r = 1 to n. Sequence contains the triangle by rows.
- Smallest prime whose product of digits is 3^n.A088653
Smallest prime whose product of digits is 3^n.
- Number of n X n matrices over GF(4) with characteristic polynomial x^n - 1.A088654
Number of n X n matrices over GF(4) with characteristic polynomial x^n - 1.
- a(n) is the absolute value of floor(x^n), where x = e/(2-e) = -3.784422... is derived from e=A001113.A088655
a(n) is the absolute value of floor(x^n), where x = e/(2-e) = -3.784422... is derived from e=A001113.
- a(n) = floor( (2/(exp(1) - 2))^n ) for n >= 2, a(1) = 1.A088656
a(n) = floor( (2/(exp(1) - 2))^n ) for n >= 2, a(1) = 1.
- Except for initial 0, same as A005213.A088657
Except for initial 0, same as A005213.
- Number of triangles in an n X n unit grid that have minimal possible area (of 1/2).A088658
Number of triangles in an n X n unit grid that have minimal possible area (of 1/2).
- a(n) = n*(p-1) where p is the largest prime factor of n.A088659
a(n) = n*(p-1) where p is the largest prime factor of n.
- A logarithmic scale Sierpinski self-similar sequence.A088660
A logarithmic scale Sierpinski self-similar sequence.