Sequences
392,541 sequences
- a(n) = 3*binomial(2*n, n-1).A062561
a(n) = 3*binomial(2*n, n-1).
- a(n) = Sum_{k=1..n} mu(k)*sigma(k).A062562
a(n) = Sum_{k=1..n} mu(k)*sigma(k).
- a(n) = Sum_{k=1..n} d(k)* mu(k), where d(k) is the number of divisors function.A062563
a(n) = Sum_{k=1..n} d(k)* mu(k), where d(k) is the number of divisors function.
- Palindromes which are the concatenation of 3 or more terms of an arithmetic sequence with nonzero difference.A062564
Palindromes which are the concatenation of 3 or more terms of an arithmetic sequence with nonzero difference.
- Squarefree parts of 3-smooth numbers.A062565
Squarefree parts of 3-smooth numbers.
- Squarefree parts of highly composite numbers (definition 1) (A002182).A062566
Squarefree parts of highly composite numbers (definition 1) (A002182).
- First multiple of n whose reverse is also divisible by n, or 0 if no such multiple exists.A062567
First multiple of n whose reverse is also divisible by n, or 0 if no such multiple exists.
- a(n) is the smallest n-digit strong pseudoprime (in base 2).A062568
a(n) is the smallest n-digit strong pseudoprime (in base 2).
- a(n) = sigma(n!).A062569
a(n) = sigma(n!).
- a(n) = phi(2*n).A062570
a(n) = phi(2*n).
- a(n) = minimum over nonnegative integers m of the size of the largest subset of pairwise relatively prime numbers in {m+1, m+2, ..., m+n}.A062571
a(n) = minimum over nonnegative integers m of the size of the largest subset of pairwise relatively prime numbers in {m+1, m+2, ..., m+n}.
- Numbers k such that 6^k - 5^k is prime.A062572
Numbers k such that 6^k - 5^k is prime.
- Numbers k such that 7^k - 6^k is prime.A062573
Numbers k such that 7^k - 6^k is prime.
- Numbers k such that 8^k - 7^k is prime or a strong pseudoprime.A062574
Numbers k such that 8^k - 7^k is prime or a strong pseudoprime.
- a(n) = maximum over m of the size of the largest subset of pairwise relatively prime numbers in {m+1, m+2, ..., m+n}.A062575
a(n) = maximum over m of the size of the largest subset of pairwise relatively prime numbers in {m+1, m+2, ..., m+n}.
- Numbers k such that 10^k - 9^k is prime.A062576
Numbers k such that 10^k - 9^k is prime.
- Numbers k such that 11^k - 10^k is prime.A062577
Numbers k such that 11^k - 10^k is prime.
- Numbers k such that 12^k - 11^k is prime.A062578
Numbers k such that 12^k - 11^k is prime.
- Numbers k such that 13^k - 12^k is prime.A062579
Numbers k such that 13^k - 12^k is prime.
- Numbers k such that 14^k - 13^k is prime.A062580
Numbers k such that 14^k - 13^k is prime.
- Numbers k such that 15^k - 14^k is prime.A062581
Numbers k such that 15^k - 14^k is prime.
- Numbers k such that 16^k - 15^k is prime.A062582
Numbers k such that 16^k - 15^k is prime.
- Numbers k such that 17^k - 16^k is prime.A062583
Numbers k such that 17^k - 16^k is prime.
- a(n) is the smallest prime whose digits include the digits of n as a substring.A062584
a(n) is the smallest prime whose digits include the digits of n as a substring.
- Numbers k such that 19^k - 18^k is prime.A062585
Numbers k such that 19^k - 18^k is prime.
- Numbers k such that 20^k - 19^k is prime.A062586
Numbers k such that 20^k - 19^k is prime.
- Numbers k such that 21^k - 20^k is prime.A062587
Numbers k such that 21^k - 20^k is prime.
- Numbers k such that 22^k - 21^k is prime.A062588
Numbers k such that 22^k - 21^k is prime.
- Numbers k such that 23^k - 22^k is prime, or a strong pseudoprime.A062589
Numbers k such that 23^k - 22^k is prime, or a strong pseudoprime.
- Variation on A029834: a discrete version of the Mangoldt function. If n is prime then floor(log(prime(n))) else 0.A062590
Variation on A029834: a discrete version of the Mangoldt function. If n is prime then floor(log(prime(n))) else 0.
- Primes of the form 6*k! + 1.A062591
Primes of the form 6*k! + 1.
- Numbers k such that 26^k - 25^k is prime or a strong pseudoprime.A062592
Numbers k such that 26^k - 25^k is prime or a strong pseudoprime.
- Numbers k such that 27^k - 26^k is prime.A062593
Numbers k such that 27^k - 26^k is prime.
- Numbers k such that 28^k - 27^k is prime.A062594
Numbers k such that 28^k - 27^k is prime.
- Numbers k such that 29^k - 28^k is prime.A062595
Numbers k such that 29^k - 28^k is prime.
- Numbers k such that 30^k - 29^k is prime.A062596
Numbers k such that 30^k - 29^k is prime.
- Numbers k such that 31^k - 30^k is prime.A062597
Numbers k such that 31^k - 30^k is prime.
- Numbers k such that 32^k - 31^k is prime.A062598
Numbers k such that 32^k - 31^k is prime.
- Numbers k such that 33^k - 32^k is prime.A062599
Numbers k such that 33^k - 32^k is prime.
- Numbers k such that 34^k - 33^k is prime.A062600
Numbers k such that 34^k - 33^k is prime.
- Numbers k such that 35^k - 34^k is prime.A062601
Numbers k such that 35^k - 34^k is prime.
- Number of ways of writing n = p+c with p prime and c nonprime (1 or a composite number).A062602
Number of ways of writing n = p+c with p prime and c nonprime (1 or a composite number).
- Numbers k such that 37^k - 36^k is prime.A062603
Numbers k such that 37^k - 36^k is prime.
- Numbers k such that 38^k - 37^k is prime.A062604
Numbers k such that 38^k - 37^k is prime.
- Numbers k such that 39^k - 38^k is prime.A062605
Numbers k such that 39^k - 38^k is prime.
- Numbers k such that 40^k - 39^k is prime.A062606
Numbers k such that 40^k - 39^k is prime.
- Numbers k such that 41^k - 40^k is prime.A062607
Numbers k such that 41^k - 40^k is prime.
- Numbers k such that 42^k - 41^k is prime.A062608
Numbers k such that 42^k - 41^k is prime.
- Numbers k such that 43^k - 42^k is prime or a strong pseudoprime.A062609
Numbers k such that 43^k - 42^k is prime or a strong pseudoprime.
- Number of ways of writing n = c1 + c2 with c1 and c2 nonprimes [=1 or composite].A062610
Number of ways of writing n = c1 + c2 with c1 and c2 nonprimes [=1 or composite].