Sequences
392,541 sequences
- Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.A065511
Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.
- Numbers n such that sigma(n) + 1 is prime.A065512
Numbers n such that sigma(n) + 1 is prime.
- Number of endofunctions of [n] with a cycle a->b->c->a and for all x in [n], some iterate f^k(x)=a.A065513
Number of endofunctions of [n] with a cycle a->b->c->a and for all x in [n], some iterate f^k(x)=a.
- Largest power of a prime < prime(n).A065514
Largest power of a prime < prime(n).
- Number of prime powers <= n.A065515
Number of prime powers <= n.
- Differences between products of 2 primes.A065516
Differences between products of 2 primes.
- Numerator of n/(sum of the digits of n).A065517
Numerator of n/(sum of the digits of n).
- Denominator of n/(sum of the digits of n).A065518
Denominator of n/(sum of the digits of n).
- a(n) = A064413(n)-n.A065519
a(n) = A064413(n)-n.
- Numbers n with the property that if m is formed from n by dropping any number (possibly zero) of initial or final digits then there is a prime ending with m.A065520
Numbers n with the property that if m is formed from n by dropping any number (possibly zero) of initial or final digits then there is a prime ending with m.
- a(n) = floor(prime(n) / n) * n - prime(n) mod n.A065521
a(n) = floor(prime(n) / n) * n - prime(n) mod n.
- Numbers k such that sigma(k) and sigma(k+1) are nontrivial powers (A065496).A065522
Numbers k such that sigma(k) and sigma(k+1) are nontrivial powers (A065496).
- Numbers n such that sigma(n) is a prime power (A025475).A065523
Numbers n such that sigma(n) is a prime power (A025475).
- The (5^n)-th composite number.A065524
The (5^n)-th composite number.
- The (6^n)-th composite number.A065525
The (6^n)-th composite number.
- The (11^n)-th composite number.A065526
The (11^n)-th composite number.
- The (12^n)-th composite number.A065527
The (12^n)-th composite number.
- Numbers n such that phi(n) is a nontrivial power b^c where b > 1 and c > 1.A065528
Numbers n such that phi(n) is a nontrivial power b^c where b > 1 and c > 1.
- "Inverted" decimal expansion of Pi.A065529
"Inverted" decimal expansion of Pi.
- If n is odd then a(n) = n, else a(n) = n*(n+2).A065530
If n is odd then a(n) = n, else a(n) = n*(n+2).
- Number of palindromes in all base b representations for n, for 2<=b<=n.A065531
Number of palindromes in all base b representations for n, for 2<=b<=n.
- a(n) = 48*n^2 - 1.A065532
a(n) = 48*n^2 - 1.
- a(n) is smallest prime > 10*a(n-1), a(1) = 3.A065533
a(n) is smallest prime > 10*a(n-1), a(1) = 3.
- a(n) is smallest prime > 10*a(n-1), a(1) = 5.A065534
a(n) is smallest prime > 10*a(n-1), a(1) = 5.
- Number of strongly perfect lattices in dimension n.A065535
Number of strongly perfect lattices in dimension n.
- Number of strongly eutactic lattices in dimension n.A065536
Number of strongly eutactic lattices in dimension n.
- a(n) is smallest prime > 10*a(n-1), a(1) = 7.A065537
a(n) is smallest prime > 10*a(n-1), a(1) = 7.
- a(n) is smallest prime > 10*a(n-1), a(1) = 11.A065538
a(n) is smallest prime > 10*a(n-1), a(1) = 11.
- a(n) is smallest prime > 10*a(n-1), a(1) = 13.A065539
a(n) is smallest prime > 10*a(n-1), a(1) = 13.
- a(n) is smallest prime > 3*a(n-1), a(1) = 3.A065540
a(n) is smallest prime > 3*a(n-1), a(1) = 3.
- a(n) is smallest prime > 5*a(n-1), a(1) = 5.A065541
a(n) is smallest prime > 5*a(n-1), a(1) = 5.
- a(n) is smallest prime > 7*a(n-1), a(1) = 7.A065542
a(n) is smallest prime > 7*a(n-1), a(1) = 7.
- a(n) is smallest prime > 11*a(n-1), a(1) = 11.A065543
a(n) is smallest prime > 11*a(n-1), a(1) = 11.
- a(n) is smallest prime > 13*a(n-1), a(1) = 13.A065544
a(n) is smallest prime > 13*a(n-1), a(1) = 13.
- a(n) is smallest prime > 2*a(n-1), a(1) = 3.A065545
a(n) is smallest prime > 2*a(n-1), a(1) = 3.
- a(n) is smallest prime > 2*a(n-1), a(1) = 13.A065546
a(n) is smallest prime > 2*a(n-1), a(1) = 13.
- Triangle of Salie numbers.A065547
Triangle of Salie numbers.
- a(1) = 1 and, for n > 0, a(2*n) = sum{a(i) | 0 < i <= n}, a(2*n+1) = a(n)^2.A065548
a(1) = 1 and, for n > 0, a(2*n) = sum{a(i) | 0 < i <= n}, a(2*n+1) = a(n)^2.
- a(1) = 1; for n > 1, a(n) = 2^((A000043(n) - 1)/2).A065549
a(1) = 1; for n > 1, a(n) = 2^((A000043(n) - 1)/2).
- a(n) = floor(sqrt(phi(w)*sigma(w)+w^2)), where w=10^n.A065550
a(n) = floor(sqrt(phi(w)*sigma(w)+w^2)), where w=10^n.
- Triangle of Faulhaber numbers (numerators) read by rows.A065551
Triangle of Faulhaber numbers (numerators) read by rows.
- a(n) = floor(sqrt(phi(10^n)*sigma(10^n) + 10^(3*n))).A065552
a(n) = floor(sqrt(phi(10^n)*sigma(10^n) + 10^(3*n))).
- Triangle of Faulhaber numbers (denominators) read by rows.A065553
Triangle of Faulhaber numbers (denominators) read by rows.
- Numbers k such that floor((3/2)^(k+1))/floor((3/2)^k) = 3/2.A065554
Numbers k such that floor((3/2)^(k+1))/floor((3/2)^k) = 3/2.
- Numbers n such that phi(phi(n)) = phi(sigma(n)) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.A065555
Numbers n such that phi(phi(n)) = phi(sigma(n)) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.
- Numbers n such that sigma (phi ( n ) ) = sigma (sigma (n ) ) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.A065556
Numbers n such that sigma (phi ( n ) ) = sigma (sigma (n ) ) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.A065557
Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.
- Let G_n be the group of invertible 2 X 2 matrices mod n (sequence A000252). a(n) is the maximal degree of an irreducible representation of G_n.A065558
Let G_n be the group of invertible 2 X 2 matrices mod n (sequence A000252). a(n) is the maximal degree of an irreducible representation of G_n.
- Smallest k such that tau(n+k) = tau(k).A065559
Smallest k such that tau(n+k) = tau(k).
- a(n) is the smallest integer k such that floor((1+1/n)^(k+1))/floor((1+1/n)^k) = 1+1/n.A065560
a(n) is the smallest integer k such that floor((1+1/n)^(k+1))/floor((1+1/n)^k) = 1+1/n.