Sequences
392,541 sequences
- Numbers k such that k + sum_of_digits(k) is a cube.A084661
Numbers k such that k + sum_of_digits(k) is a cube.
- a(1) = 4; a(n) = a(n-1) + gcd(a(n-1), n).A084662
a(1) = 4; a(n) = a(n-1) + gcd(a(n-1), n).
- a(1) = 8; a(n) = a(n-1) + gcd(a(n-1), n).A084663
a(1) = 8; a(n) = a(n-1) + gcd(a(n-1), n).
- Duplicate of A045620.A084664
Duplicate of A045620.
- a(n) = A074104(n)/n.A084665
a(n) = A074104(n)/n.
- Lunar primes that are also rational primes.A084666
Lunar primes that are also rational primes.
- Primes which are a concatenation of n and prime(n).A084667
Primes which are a concatenation of n and prime(n).
- Brilliant Niven numbers, i.e., numbers with two prime factors of the same length (in decimal notation) which are also divisible by the sum of their digits.A084668
Brilliant Niven numbers, i.e., numbers with two prime factors of the same length (in decimal notation) which are also divisible by the sum of their digits.
- Primes which are a concatenation of prime(n) and n.A084669
Primes which are a concatenation of prime(n) and n.
- Numbers k such that concatenation of prime(k) and k is prime.A084670
Numbers k such that concatenation of prime(k) and k is prime.
- Primes such that the decimal concatenation of prime(n) and n is prime.A084671
Primes such that the decimal concatenation of prime(n) and n is prime.
- Expansion of g.f.: (1+x^2+2*x^4)/((1-x^3)*(1-x)^2).A084672
Expansion of g.f.: (1+x^2+2*x^4)/((1-x^3)*(1-x)^2).
- Smallest prime in which a digit appears n times.A084673
Smallest prime in which a digit appears n times.
- Products of the digits of e excluding 0.A084674
Products of the digits of e excluding 0.
- Product of the first n digits of the Golden Ratio phi = 1.6180339... (treating 0's as if they were 1's).A084675
Product of the first n digits of the Golden Ratio phi = 1.6180339... (treating 0's as if they were 1's).
- Position of the first zero in the decimal expansion of the square root of the n-th prime.A084676
Position of the first zero in the decimal expansion of the square root of the n-th prime.
- Position of the first zero in the decimal expansion of sqrt(n).A084677
Position of the first zero in the decimal expansion of sqrt(n).
- a(n)=b(n,n) with b(n,1)=n and b(n,k)=binomial(b(n,k-1),d(n,n-k+1)) for 1<k<=n, where d(n,i) are the divisors of n, d(i)<d(j), 1<=i<j<=A000005(n).A084678
a(n)=b(n,n) with b(n,1)=n and b(n,k)=binomial(b(n,k-1),d(n,n-k+1)) for 1<k<=n, where d(n,i) are the divisors of n, d(i)<d(j), 1<=i<j<=A000005(n).
- Composite numbers with coprime numbers of prime factors with and without repetition.A084679
Composite numbers with coprime numbers of prime factors with and without repetition.
- Order of 10 modulo n [i.e., least m such that 10^m = 1 (mod n)] or 0 when no such number exists.A084680
Order of 10 modulo n [i.e., least m such that 10^m = 1 (mod n)] or 0 when no such number exists.
- Order of 10 modulo 9n [i.e., least m such that 10^m = 1 (mod 9n)] or 0 when no such number exists.A084681
Order of 10 modulo 9n [i.e., least m such that 10^m = 1 (mod 9n)] or 0 when no such number exists.
- Even evil numbers with an even digital sum.A084682
Even evil numbers with an even digital sum.
- Expansion of g.f.: (1+2*x^3+2*x^6)/((1-x)*(1-x-x^2+x^3-x^4-x^5+x^6)).A084683
Expansion of g.f.: (1+2*x^3+2*x^6)/((1-x)*(1-x-x^2+x^3-x^4-x^5+x^6)).
- Degrees of certain maps (see Comments and Formulas for more precise definitions).A084684
Degrees of certain maps (see Comments and Formulas for more precise definitions).
- a(n) is the least x such that length of fixed-point-list when function-A085307[] was iterated and started at a(n) equals n.A084685
a(n) is the least x such that length of fixed-point-list when function-A085307[] was iterated and started at a(n) equals n.
- Take n-th prime p(n), rewrite it with digits in decreasing order to get b(n), then a(n)=(b(n)-p(n))/9.A084686
Take n-th prime p(n), rewrite it with digits in decreasing order to get b(n), then a(n)=(b(n)-p(n))/9.
- Nontrivial numbers k containing no zero digits which are divisible by the number formed by writing the digits of k in ascending order.A084687
Nontrivial numbers k containing no zero digits which are divisible by the number formed by writing the digits of k in ascending order.
- Nonnegative integers n such that 2^n uses only distinct decimal digits.A084688
Nonnegative integers n such that 2^n uses only distinct decimal digits.
- 3^n uses only distinct decimal digits.A084689
3^n uses only distinct decimal digits.
- 4^n uses only distinct decimal digits.A084690
4^n uses only distinct decimal digits.
- 10000 times the n-th zero of the BesselJ function of zero order, rounded.A084691
10000 times the n-th zero of the BesselJ function of zero order, rounded.
- Sum of first n zeros of BesselJ function of zero order.A084692
Sum of first n zeros of BesselJ function of zero order.
- a(n) is smallest positive integer not already in the sequence such that every partial sum is squarefree.A084693
a(n) is smallest positive integer not already in the sequence such that every partial sum is squarefree.
- Squarefree numbers which are products of three consecutive numbers. I.e., squarefree numbers of the form k^3 - k.A084694
Squarefree numbers which are products of three consecutive numbers. I.e., squarefree numbers of the form k^3 - k.
- Triangle read by rows in which row n lists the n smallest positive numbers k such that k + n is a prime.A084695
Triangle read by rows in which row n lists the n smallest positive numbers k such that k + n is a prime.
- Beginning with 3, primes such that a(2n) = {a(2n-1) +a(2n+1)}/2.A084696
Beginning with 3, primes such that a(2n) = {a(2n-1) +a(2n+1)}/2.
- a(1) = 2; for n >= 1, k>=1, a(n+1) = a(n) + k*n is the smallest such prime.A084697
a(1) = 2; for n >= 1, k>=1, a(n+1) = a(n) + k*n is the smallest such prime.
- Beginning with 1 the smallest multiple of n such that the n-th partial sum is a square.A084698
Beginning with 1 the smallest multiple of n such that the n-th partial sum is a square.
- Composite numbers j such that binomial(2*j,j) == 2^j (mod j).A084699
Composite numbers j such that binomial(2*j,j) == 2^j (mod j).
- Smallest k such that k*prime(i)+1 is prime for i = 1 to n.A084700
Smallest k such that k*prime(i)+1 is prime for i = 1 to n.
- Smallest k such that k*prime(i)-1 is prime for i = 1 to n.A084701
Smallest k such that k*prime(i)-1 is prime for i = 1 to n.
- a(n) is the smallest k such that k + 1 and n*k + 1 both are perfect squares, or 0 if no such number exists.A084702
a(n) is the smallest k such that k + 1 and n*k + 1 both are perfect squares, or 0 if no such number exists.
- Squares k such that 2*k+1 is also a square.A084703
Squares k such that 2*k+1 is also a square.
- Smallest prime p > prime(n) such that (p + prime(n))/2 is prime.A084704
Smallest prime p > prime(n) such that (p + prime(n))/2 is prime.
- Duplicate of A051886.A084705
Duplicate of A051886.
- Duplicate of A051900.A084706
Duplicate of A051900.
- a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4) for n > 3, with a(0) = 1, a(1) = 3, a(2) = 9, a(3) = 27.A084707
a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4) for n > 3, with a(0) = 1, a(1) = 3, a(2) = 9, a(3) = 27.
- Number of set partitions up to rotations and reflections.A084708
Number of set partitions up to rotations and reflections.
- a(1) = 4, for n > 1, a(n) = smallest multiple of a(n-1) such that a(n)-1 and a(n)+1 are twin primes.A084709
a(1) = 4, for n > 1, a(n) = smallest multiple of a(n-1) such that a(n)-1 and a(n)+1 are twin primes.
- Beginning with 2 the smallest prime greater than the previous term such that the difference of successive terms is a distinct square.A084710
Beginning with 2 the smallest prime greater than the previous term such that the difference of successive terms is a distinct square.