Sequences
392,541 sequences
- a(1) = 1; a(n+1) is the smallest square greater than n*a(n).A077211
a(1) = 1; a(n+1) is the smallest square greater than n*a(n).
- a(n) = A077211(n)^(1/2).A077212
a(n) = A077211(n)^(1/2).
- a(1) = 2, a(n+1) is the smallest prime greater than n*a(n).A077213
a(1) = 2, a(n+1) is the smallest prime greater than n*a(n).
- a(1) = 1. a(n+1) is the smallest number which is greater than a(n), coprime to it and has a different prime signature.A077214
a(1) = 1. a(n+1) is the smallest number which is greater than a(n), coprime to it and has a different prime signature.
- Prime power with largest index that divides the product of composite numbers between successive primes with a(1) = a(2) = 1.A077215
Prime power with largest index that divides the product of composite numbers between successive primes with a(1) = a(2) = 1.
- Smallest prime(k) such that 2^n divides the product of composite numbers between prime(k) and prime(k+1) but 2^(n+1) does not.A077216
Smallest prime(k) such that 2^n divides the product of composite numbers between prime(k) and prime(k+1) but 2^(n+1) does not.
- Prime(k) such that the prime power with largest exponent that divides the product P(k) of composite numbers between prime(k) and prime(k+1) is an odd number, i.e., if p^r and 2^s divide P(k) then r >= s, p is an odd prime.A077217
Prime(k) such that the prime power with largest exponent that divides the product P(k) of composite numbers between prime(k) and prime(k+1) is an odd number, i.e., if p^r and 2^s divide P(k) then r >= s, p is an odd prime.
- Sum of numbers of prime factors (counted with multiplicities) of numbers between n-th and (n+1)-st prime.A077218
Sum of numbers of prime factors (counted with multiplicities) of numbers between n-th and (n+1)-st prime.
- Floor(geometric mean of the reduced residue system modulo n).A077219
Floor(geometric mean of the reduced residue system modulo n).
- a(1) = 1; thereafter a(n) is smallest number not occurring earlier such that a(n-1)+a(n) is a triangular number.A077220
a(1) = 1; thereafter a(n) is smallest number not occurring earlier such that a(n-1)+a(n) is a triangular number.
- a(0) = 0 and then alternately even and odd numbers in increasing order such that the sum of any two successive terms is a square.A077221
a(0) = 0 and then alternately even and odd numbers in increasing order such that the sum of any two successive terms is a square.
- a(1) = 1 and then alternately the smallest even and odd numbers not occurring earlier such that the sum of two successive terms is a square.A077222
a(1) = 1 and then alternately the smallest even and odd numbers not occurring earlier such that the sum of two successive terms is a square.
- a(1) = 1 and then alternately even and odd numbers not occurring earlier such that the sum of any two successive terms is a squarefree number.A077223
a(1) = 1 and then alternately even and odd numbers not occurring earlier such that the sum of any two successive terms is a squarefree number.
- a(0) = 1; for n > 1, a(n) = smallest number > a(n-1) such that a(n) + a(k) is squarefree for k = 1 to n-1.A077224
a(0) = 1; for n > 1, a(n) = smallest number > a(n-1) such that a(n) + a(k) is squarefree for k = 1 to n-1.
- Starting with a(0) = 1, smallest squarefree number k such that, for all a(m), m < n, k + a(m) is not squarefree.A077225
Starting with a(0) = 1, smallest squarefree number k such that, for all a(m), m < n, k + a(m) is not squarefree.
- Inverse of A051261, i.e., (n, a(n), a(n)) is a winning position in 3-pile Wythoff game.A077226
Inverse of A051261, i.e., (n, a(n), a(n)) is a winning position in 3-pile Wythoff game.
- Triangle of compositions of n into exactly k parts each no more than k.A077227
Triangle of compositions of n into exactly k parts each no more than k.
- Triangle of compositions with a total that is no more than n into exactly k parts each no more than k.A077228
Triangle of compositions with a total that is no more than n into exactly k parts each no more than k.
- Number of compositions of n where the largest part is less than or equal to the number of parts.A077229
Number of compositions of n where the largest part is less than or equal to the number of parts.
- Numerators of coefficients of series expansion of a certain integral in the theory of charged particle beams.A077230
Numerators of coefficients of series expansion of a certain integral in the theory of charged particle beams.
- Denominators of coefficients of series expansion of a certain integral in the theory of charged particle beams.A077231
Denominators of coefficients of series expansion of a certain integral in the theory of charged particle beams.
- a(n) is smallest natural number a satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).A077232
a(n) is smallest natural number a satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).
- a(n) is smallest natural number a satisfying Pell equation b^2- d(n)*a^2= +1 or = -1, with d(n)=A000037(n) (nonsquare). Corresponding smallest b(n)=A077232(n).A077233
a(n) is smallest natural number a satisfying Pell equation b^2- d(n)*a^2= +1 or = -1, with d(n)=A000037(n) (nonsquare). Corresponding smallest b(n)=A077232(n).
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077234
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077235
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- a(n) = 4*a(n-1) - a(n-2) with a(0) = 4 and a(1) = 11.A077236
a(n) = 4*a(n-1) - a(n-2) with a(0) = 4 and a(1) = 11.
- Combined Diophantine Chebyshev sequences A054491 and A077234.A077237
Combined Diophantine Chebyshev sequences A054491 and A077234.
- Combined Diophantine Chebyshev sequences A077236 and A077235.A077238
Combined Diophantine Chebyshev sequences A077236 and A077235.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077239
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (even part) of Chebyshev sequence with Diophantine property.A077240
Bisection (even part) of Chebyshev sequence with Diophantine property.
- Combined Diophantine Chebyshev sequences A054488 and A077413.A077241
Combined Diophantine Chebyshev sequences A054488 and A077413.
- Combined Diophantine Chebyshev sequences A077240 and A077239.A077242
Combined Diophantine Chebyshev sequences A077240 and A077239.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077243
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077244
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (even part) of Chebyshev sequence with Diophantine property.A077245
Bisection (even part) of Chebyshev sequence with Diophantine property.
- Bisection (even part) of Chebyshev sequence with Diophantine property.A077246
Bisection (even part) of Chebyshev sequence with Diophantine property.
- Combined Diophantine Chebyshev sequences A077245 and A077243.A077247
Combined Diophantine Chebyshev sequences A077245 and A077243.
- Combined Diophantine Chebyshev sequences A077246 and A077244.A077248
Combined Diophantine Chebyshev sequences A077246 and A077244.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077249
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077250
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- Bisection (even part) of Chebyshev sequence with Diophantine property.A077251
Bisection (even part) of Chebyshev sequence with Diophantine property.
- Sum of digits squared minus sum of digits of n.A077252
Sum of digits squared minus sum of digits of n.
- Sum of digits squared plus sum of digits of n.A077253
Sum of digits squared plus sum of digits of n.
- a(n) = prime(n)^n mod n.A077254
a(n) = prime(n)^n mod n.
- Numbers k such that prime(k)^k == 1 (mod k).A077255
Numbers k such that prime(k)^k == 1 (mod k).
- Primes p such that p^k == 1 modulo k, where p=prime(k).A077256
Primes p such that p^k == 1 modulo k, where p=prime(k).
- Differences between two successive prime powers of prime numbers (A076707) in more than one way.A077257
Differences between two successive prime powers of prime numbers (A076707) in more than one way.
- Least number which can be represented by the difference between two successive prime powers of prime numbers (A076707) in exactly n ways.A077258
Least number which can be represented by the difference between two successive prime powers of prime numbers (A076707) in exactly n ways.
- First member of the Diophantine pair (m,k) that satisfies 5*(m^2 + m) = k^2 + k; a(n) = m.A077259
First member of the Diophantine pair (m,k) that satisfies 5*(m^2 + m) = k^2 + k; a(n) = m.
- Triangular numbers that are 1/5 of a triangular number.A077260
Triangular numbers that are 1/5 of a triangular number.