Sequences
392,541 sequences
- a(1) = 1; for n >= 2, a(n) = (d(n)-1)-th highest positive integer that equals no a(k), 1 <= k < n, where d(n) is the number of positive divisors of n, A000005(n).A065561
a(1) = 1; for n >= 2, a(n) = (d(n)-1)-th highest positive integer that equals no a(k), 1 <= k < n, where d(n) is the number of positive divisors of n, A000005(n).
- a(n) = b(n)-th highest positive integer not equal to any a(k), 1 <= k < n, where {b(n)} = 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, ... (sequence A002260).A065562
a(n) = b(n)-th highest positive integer not equal to any a(k), 1 <= k < n, where {b(n)} = 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, ... (sequence A002260).
- Product of three consecutive Fibonacci numbers.A065563
Product of three consecutive Fibonacci numbers.
- Numbers k such that floor((4/3)^(k+1))/floor((4/3)^k) = 4/3.A065564
Numbers k such that floor((4/3)^(k+1))/floor((4/3)^k) = 4/3.
- a(n) = floor((5/4)^n).A065565
a(n) = floor((5/4)^n).
- Numbers k such that floor((5/4)^(k+1))/floor((5/4)^k) = 5/4.A065566
Numbers k such that floor((5/4)^(k+1))/floor((5/4)^k) = 5/4.
- T(n,m) is the sum over all m-subsets of {1,...,n} of the gcd of the subset.A065567
T(n,m) is the sum over all m-subsets of {1,...,n} of the gcd of the subset.
- Sum over all subsets of {1,..,n} of the GCD of the subset.A065568
Sum over all subsets of {1,..,n} of the GCD of the subset.
- Smallest k such that omega(n+k) = omega(k).A065569
Smallest k such that omega(n+k) = omega(k).
- Numbers k such that the first k ternary digits found in the decimal expansion of Pi form a prime.A065570
Numbers k such that the first k ternary digits found in the decimal expansion of Pi form a prime.
- Numbers whose decimal digits can be permuted to give a multiple of 11.A065571
Numbers whose decimal digits can be permuted to give a multiple of 11.
- Composite numbers k such that phi(k) = phi(k-1) + phi(k-2).A065572
Composite numbers k such that phi(k) = phi(k-1) + phi(k-2).
- Numbers k such that the first k quinary digits found in the decimal expansion of Pi form a prime.A065573
Numbers k such that the first k quinary digits found in the decimal expansion of Pi form a prime.
- Numbers k such that the first k decimal digits < 6 of Pi, read as a base-6 number, form a prime.A065574
Numbers k such that the first k decimal digits < 6 of Pi, read as a base-6 number, form a prime.
- Numbers k such that the first k septenary digits found in the decimal expansion of Pi form a prime.A065575
Numbers k such that the first k septenary digits found in the decimal expansion of Pi form a prime.
- Numbers k such that the first k nonary digits found in decimal expansion of Pi form a prime.A065576
Numbers k such that the first k nonary digits found in decimal expansion of Pi form a prime.
- Number of Goldbach partitions of 10^n.A065577
Number of Goldbach partitions of 10^n.
- Inverse permutation to A065561.A065578
Inverse permutation to A065561.
- Inverse permutation to A065562.A065579
Inverse permutation to A065562.
- Smallest prime ending in exactly n 3's.A065580
Smallest prime ending in exactly n 3's.
- Smallest prime ending in exactly n 7's.A065581
Smallest prime ending in exactly n 7's.
- Smallest prime ending in exactly n 9's.A065582
Smallest prime ending in exactly n 9's.
- Sum of numbers which in base n have (n-1) distinct nonzero digits.A065583
Sum of numbers which in base n have (n-1) distinct nonzero digits.
- Smallest prime beginning with exactly n 1's.A065584
Smallest prime beginning with exactly n 1's.
- Smallest prime beginning with exactly n 2's.A065585
Smallest prime beginning with exactly n 2's.
- Smallest prime beginning with exactly n 3's.A065586
Smallest prime beginning with exactly n 3's.
- Smallest prime beginning with exactly n 4's.A065587
Smallest prime beginning with exactly n 4's.
- Smallest prime beginning with exactly n 5's.A065588
Smallest prime beginning with exactly n 5's.
- Smallest prime beginning with exactly n 6's.A065589
Smallest prime beginning with exactly n 6's.
- Smallest prime beginning with exactly n 7's.A065590
Smallest prime beginning with exactly n 7's.
- Smallest prime beginning with exactly n 8's.A065591
Smallest prime beginning with exactly n 8's.
- Smallest prime beginning with exactly n 9's.A065592
Smallest prime beginning with exactly n 9's.
- First re-appearance of first n digits in decimal expansion of Pi.A065593
First re-appearance of first n digits in decimal expansion of Pi.
- a(n) = A036981(n)/(2n)!.A065594
a(n) = A036981(n)/(2n)!.
- a(n) = (sum of first n primes)^2 - sum of squares of first n primes.A065595
a(n) = (sum of first n primes)^2 - sum of squares of first n primes.
- The first n binary digits found in decimal expansion of e form a prime.A065596
The first n binary digits found in decimal expansion of e form a prime.
- a(0)=0, a(1)=1, a(2)=1; for n >= 3, a(n) = 2*a(n-1)*a(n-2) - a(n-3).A065597
a(0)=0, a(1)=1, a(2)=1; for n >= 3, a(n) = 2*a(n-1)*a(n-2) - a(n-3).
- a(0)=0, a(1)=1, a(2)=2; for n >= 3, a(n) = 2*a(n-1)*a(n-2) - a(n-3).A065598
a(0)=0, a(1)=1, a(2)=2; for n >= 3, a(n) = 2*a(n-1)*a(n-2) - a(n-3).
- If n odd, a(n) = n^2 else a(n) = n.A065599
If n odd, a(n) = n^2 else a(n) = n.
- Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n).A065600
Triangle T(n,k) giving number of Dyck paths of length 2n with exactly k hills (0 <= k <= n).
- Number of Dyck paths of length 2n with exactly 1 hill.A065601
Number of Dyck paths of length 2n with exactly 1 hill.
- Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.A065602
Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.
- Transposition diameter: maximal number of moves in an optimal sorting of n objects by moving blocks.A065603
Transposition diameter: maximal number of moves in an optimal sorting of n objects by moving blocks.
- a(n) = smallest k satisfying the equation phi(k) = phi(k-1) + phi(k-2) and having just n prime factors.A065604
a(n) = smallest k satisfying the equation phi(k) = phi(k-1) + phi(k-2) and having just n prime factors.
- The (3^n)-th composite number.A065605
The (3^n)-th composite number.
- The (7^n)-th composite number.A065606
The (7^n)-th composite number.
- Related to reciprocal Pythagorean triples: 1/a(n)^2 + 1/k^2 = 1/j^2 has an integer solution (k,j) with k<a(n).A065607
Related to reciprocal Pythagorean triples: 1/a(n)^2 + 1/k^2 = 1/j^2 has an integer solution (k,j) with k<a(n).
- Sum of divisors of n minus the number of divisors of n.A065608
Sum of divisors of n minus the number of divisors of n.
- Positive m such that when written in binary, no rotated value of m is greater than m.A065609
Positive m such that when written in binary, no rotated value of m is greater than m.
- Smallest number m so that n^2 + A000330(m) is also a square, i.e., n^2 + (1 + 4 + 9 + 16 + ... + m^2) = w^2 for some w.A065610
Smallest number m so that n^2 + A000330(m) is also a square, i.e., n^2 + (1 + 4 + 9 + 16 + ... + m^2) = w^2 for some w.