Sequences
392,541 sequences
- a(1)=1, a(n) = n - a(a(ceiling(n/2))).A079411
a(1)=1, a(n) = n - a(a(ceiling(n/2))).
- Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.A079412
Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.
- Number of ways to write n as sum of powers p^e of distinct primes p such that e>0 and p does not divide n.A079413
Number of ways to write n as sum of powers p^e of distinct primes p such that e>0 and p does not divide n.
- a(n) = 4*n^4 - 3*n^2.A079414
a(n) = 4*n^4 - 3*n^2.
- a(n) = floor(prime(n)/n) * ceiling(prime(n)/n) / 2.A079415
a(n) = floor(prime(n)/n) * ceiling(prime(n)/n) / 2.
- a(n) = round(prime(n)/n).A079416
a(n) = round(prime(n)/n).
- Numbers n such that round(prime(n)/n) < round(prime(n-1)/(n-1)).A079417
Numbers n such that round(prime(n)/n) < round(prime(n-1)/(n-1)).
- Numbers k such that prime(k)/k < prime(k-1)/(k-1).A079418
Numbers k such that prime(k)/k < prime(k-1)/(k-1).
- Primes p such that p/i(p) < prime(i(p)-1)/(i(p)-1), where i(p) = A049084(p).A079419
Primes p such that p/i(p) < prime(i(p)-1)/(i(p)-1), where i(p) = A049084(p).
- Duplicate of A076895.A079420
Duplicate of A076895.
- Spiro-Fibonacci differences, a(n) = difference of two previous terms that are nearest when terms arranged in a spiral.A079421
Spiro-Fibonacci differences, a(n) = difference of two previous terms that are nearest when terms arranged in a spiral.
- a(n) = number of 1's in the first n^2 Spiro-Fibonacci differences.A079422
a(n) = number of 1's in the first n^2 Spiro-Fibonacci differences.
- Marks on lexicographically earliest 8-mark optimal Golomb ruler.A079423
Marks on lexicographically earliest 8-mark optimal Golomb ruler.
- A bisection of A024675. Cf. A058296.A079424
A bisection of A024675. Cf. A058296.
- Marks on lexicographically earliest 9-mark optimal Golomb ruler.A079425
Marks on lexicographically earliest 9-mark optimal Golomb ruler.
- Marks on lexicographically earliest 10-mark optimal Golomb ruler.A079426
Marks on lexicographically earliest 10-mark optimal Golomb ruler.
- Least m > n having the same number of divisors as n, a(1) = 1.A079427
Least m > n having the same number of divisors as n, a(1) = 1.
- Least coprime number m > n with same number of divisors as n, a(1) = 1.A079428
Least coprime number m > n with same number of divisors as n, a(1) = 1.
- a(0) = 2, a(1) = 3, a(2) = 5; a(n) = a(n-1) + [a(n-1)-a(n-2)] * [a(n-2)-a(n-3)].A079429
a(0) = 2, a(1) = 3, a(2) = 5; a(n) = a(n-1) + [a(n-1)-a(n-2)] * [a(n-2)-a(n-3)].
- Marks on lexicographically earliest 11-mark optimal Golomb ruler.A079430
Marks on lexicographically earliest 11-mark optimal Golomb ruler.
- Least m>n with same smallest odd prime factor as n.A079431
Least m>n with same smallest odd prime factor as n.
- a(n) = A079431(A079431(n)).A079432
a(n) = A079431(A079431(n)).
- Marks on lexicographically earliest 12-mark optimal Golomb ruler.A079433
Marks on lexicographically earliest 12-mark optimal Golomb ruler.
- Marks on lexicographically earliest 13-mark optimal Golomb ruler.A079434
Marks on lexicographically earliest 13-mark optimal Golomb ruler.
- Marks on lexicographically earliest 14-mark optimal Golomb ruler.A079435
Marks on lexicographically earliest 14-mark optimal Golomb ruler.
- Full Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171).A079436
Full Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171).
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071661.A079437
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071661.
- a(0) = a(1) = 1, a(n) = 2*(floor((n+1)/3) + (if n >= 14) (floor((n-10)/4) + floor((n-14)/8))).A079438
a(0) = a(1) = 1, a(n) = 2*(floor((n+1)/3) + (if n >= 14) (floor((n-10)/4) + floor((n-14)/8))).
- Longest cycle in range [A014137(n-1)..A014138(n-1)] of permutation A071661.A079439
Longest cycle in range [A014137(n-1)..A014138(n-1)] of permutation A071661.
- Number of transpositions (2-cycles) in range [A014137(n-1)..A014138(n-1)] of permutation A057505 (= Donaghey's automorphism M).A079440
Number of transpositions (2-cycles) in range [A014137(n-1)..A014138(n-1)] of permutation A057505 (= Donaghey's automorphism M).
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071663.A079441
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071663.
- Number of fixed points in range [A014137(n-1)..A014138(n)] of permutation A071663.A079442
Number of fixed points in range [A014137(n-1)..A014138(n)] of permutation A071663.
- The longest cycle in range [A014137(n-1)..A014138(n-1)] of permutation A071663.A079443
The longest cycle in range [A014137(n-1)..A014138(n-1)] of permutation A071663.
- Number of 3-cycles in range [A014137(2n+2)..A014138(2n+2)] of permutation A057505 (= Donaghey's automorphism M).A079444
Number of 3-cycles in range [A014137(2n+2)..A014138(2n+2)] of permutation A057505 (= Donaghey's automorphism M).
- phi(n)*(n-phi(n))-1 is prime.A079445
phi(n)*(n-phi(n))-1 is prime.
- Integers k such that phi(k)*(k-phi(k))+1 is prime.A079446
Integers k such that phi(k)*(k-phi(k))+1 is prime.
- Primes p such that there is an integer k satisfying p = floor(k*H(k)) where H(k) denotes the k-th harmonic number (i.e., H(k) = 1 + 1/2 + 1/3 + ... + 1/k).A079447
Primes p such that there is an integer k satisfying p = floor(k*H(k)) where H(k) denotes the k-th harmonic number (i.e., H(k) = 1 + 1/2 + 1/3 + ... + 1/k).
- Primes p such that there is at least one integer x satisfying p = x*tau(x)-1 where tau(x) = A000005(x), the number of divisors of x.A079448
Primes p such that there is at least one integer x satisfying p = x*tau(x)-1 where tau(x) = A000005(x), the number of divisors of x.
- Primes p such that there is at least one integer x satisfying p = x*tau(x)+1 where tau(x) = A000005(x), the number of divisors of x.A079449
Primes p such that there is at least one integer x satisfying p = x*tau(x)+1 where tau(x) = A000005(x), the number of divisors of x.
- a(n) = 2^(n-1)*u(n) where u(1)=1 and u(n) = frac(3/2*u(n-1)) + 1.A079450
a(n) = 2^(n-1)*u(n) where u(1)=1 and u(n) = frac(3/2*u(n-1)) + 1.
- Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.A079451
Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.
- Number of unlabeled and connected graphs on n vertices which are chordal and P5-free.A079452
Number of unlabeled and connected graphs on n vertices which are chordal and P5-free.
- Number of unlabeled and connected graphs on n vertices which are HH-free ("house-hole-free").A079453
Number of unlabeled and connected graphs on n vertices which are HH-free ("house-hole-free").
- Marks on lexicographically earliest 15-mark optimal Golomb ruler.A079454
Marks on lexicographically earliest 15-mark optimal Golomb ruler.
- Number of unlabeled and connected graphs on n vertices which are long hole-free (i.e., the graph contains no induced cycle of size 5 or more).A079455
Number of unlabeled and connected graphs on n vertices which are long hole-free (i.e., the graph contains no induced cycle of size 5 or more).
- Number of unlabeled and connected graphs which are complements of chordal graphs.A079456
Number of unlabeled and connected graphs which are complements of chordal graphs.
- Number of unlabeled and connected graphs which are weakly chordal. (G is weakly chordal iff there are no induced cycles of size 5 or more in G nor in its complement.)A079457
Number of unlabeled and connected graphs which are weakly chordal. (G is weakly chordal iff there are no induced cycles of size 5 or more in G nor in its complement.)
- Number of Gaussian integers in a reduced system modulo n.A079458
Number of Gaussian integers in a reduced system modulo n.
- Decimal expansion of constant C > 0 such that Sum_{k>=1} C^k! = 1.A079459
Decimal expansion of constant C > 0 such that Sum_{k>=1} C^k! = 1.
- Let r(n) be the real positive root of Sum_{k=1..n} x^k = 1, then a(n) = round(1/(r(n) - 1/2)).A079460
Let r(n) be the real positive root of Sum_{k=1..n} x^k = 1, then a(n) = round(1/(r(n) - 1/2)).