Sequences
392,541 sequences
- Duplicate of A083790.A086561
Duplicate of A083790.
- Duplicate of A083789.A086562
Duplicate of A083789.
- Smallest number of the form 10^k +1 with n distinct prime divisors.A086563
Smallest number of the form 10^k +1 with n distinct prime divisors.
- Smallest k such that 10^k + 1 has n distinct prime divisors.A086564
Smallest k such that 10^k + 1 has n distinct prime divisors.
- Smallest k such that (10^k - 1)/9 has n distinct prime divisors. Or a(n)= smallest value of k such that A000042(k) has exactly n distinct prime divisors.A086565
Smallest k such that (10^k - 1)/9 has n distinct prime divisors. Or a(n)= smallest value of k such that A000042(k) has exactly n distinct prime divisors.
- a(1)=2; for n>1 a(n) is the largest prime number m such that a(n-1)^(1/(n-1))>m^(1/n).A086566
a(1)=2; for n>1 a(n) is the largest prime number m such that a(n-1)^(1/(n-1))>m^(1/n).
- Length of cycle produced by the function f: (x; y; z) ->(x-y-z; y; 2*y + z) if y + = z <x and (x; y; z) ->(y + z -x; x; 2*x -z) if y +z >x when started at (n,1,1).A086567
Length of cycle produced by the function f: (x; y; z) ->(x-y-z; y; 2*y + z) if y + = z <x and (x; y; z) ->(y + z -x; x; 2*x -z) if y +z >x when started at (n,1,1).
- Smallest number having as many distinct prime factors as n has prime factors, when counted with multiplicity.A086568
Smallest number having as many distinct prime factors as n has prime factors, when counted with multiplicity.
- Product of the nonzero eigenvalues of the circulant matrix whose rows are formed by successively rotating a vector of binomial coefficients right. Generalization of A048954.A086569
Product of the nonzero eigenvalues of the circulant matrix whose rows are formed by successively rotating a vector of binomial coefficients right. Generalization of A048954.
- Expansion of (1 + 3x + 5x^2 + 7x^3 + ...) / (1 - 2x + 3x^2 - 4x^3 + ...).A086570
Expansion of (1 + 3x + 5x^2 + 7x^3 + ...) / (1 - 2x + 3x^2 - 4x^3 + ...).
- a(1)=1, for n>1: a(n) = smallest divisor of n occurring earlier at most once.A086571
a(1)=1, for n>1: a(n) = smallest divisor of n occurring earlier at most once.
- Solution to A086571(a(n))=A086571(n) and a(n)<>n.A086572
Solution to A086571(a(n))=A086571(n) and a(n)<>n.
- a(n) = 2*(10^n - 1).A086573
a(n) = 2*(10^n - 1).
- a(n) = 3*(10^n - 1).A086574
a(n) = 3*(10^n - 1).
- a(n) = 4*(10^n - 1).A086575
a(n) = 4*(10^n - 1).
- a(n) = 5*(10^n - 1).A086576
a(n) = 5*(10^n - 1).
- a(n) = 6*(10^n - 1).A086577
a(n) = 6*(10^n - 1).
- a(n) = 7*(10^n - 1).A086578
a(n) = 7*(10^n - 1).
- a(n) = 8*(10^n - 1).A086579
a(n) = 8*(10^n - 1).
- a(n) = 9*(10^n - 1).A086580
a(n) = 9*(10^n - 1).
- Number of Dyck paths of semilength n with no DDUU.A086581
Number of Dyck paths of semilength n with no DDUU.
- First 2^n terms of the self-convolution generates the next 2^n terms of this sequence after the 2^n-th term, for all n>=0, where a(0)=1.A086582
First 2^n terms of the self-convolution generates the next 2^n terms of this sequence after the 2^n-th term, for all n>=0, where a(0)=1.
- Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.A086583
Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.
- a(n) = A086582(2^n-1) for n>=0.A086584
a(n) = A086582(2^n-1) for n>=0.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutations A085169/A085170.A086585
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutations A085169/A085170.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A074681/A074682 & A074683/A074684.A086586
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A074681/A074682 & A074683/A074684.
- Least common multiple of cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutations A085169/A085170.A086587
Least common multiple of cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutations A085169/A085170.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.A086588
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.A086589
Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.A086590
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.
- Least common multiple of cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.A086591
Least common multiple of cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutations A072088/A072089.
- Denominators in left-hand half of Kepler's tree of fractions.A086592
Denominators in left-hand half of Kepler's tree of fractions.
- Bisection of A086592, denominators of the left-hand half of Kepler's tree of fractions.A086593
Bisection of A086592, denominators of the left-hand half of Kepler's tree of fractions.
- a(n) = 8*a(n-1) + a(n-2), starting with a(0)=2 and a(1)=8.A086594
a(n) = 8*a(n-1) + a(n-2), starting with a(0)=2 and a(1)=8.
- Number of ways to arrange the numbers 1..n in a circle (up to direction) such that every two adjacent numbers are relatively prime.A086595
Number of ways to arrange the numbers 1..n in a circle (up to direction) such that every two adjacent numbers are relatively prime.
- An invariant of the set {Log(2), Log(3), Log(5),..., Log(Prime(2n)), Log(Prime(2n+1))}.A086596
An invariant of the set {Log(2), Log(3), Log(5),..., Log(Prime(2n)), Log(Prime(2n+1))}.
- Number of primitive prime factors in Fibonacci(n).A086597
Number of primitive prime factors in Fibonacci(n).
- Number of distinct prime factors in Lucas(n).A086598
Number of distinct prime factors in Lucas(n).
- Number of prime factors in Lucas(n), counting multiplicity.A086599
Number of prime factors in Lucas(n), counting multiplicity.
- Number of primitive prime factors in the n-th Lucas number A000204(n).A086600
Number of primitive prime factors in the n-th Lucas number A000204(n).
- Triangular numbers + 1 squared.A086601
Triangular numbers + 1 squared.
- a(n) = A000217(A000217(n))-n^2.A086602
a(n) = A000217(A000217(n))-n^2.
- a(n) = n^3*3^(n-1).A086603
a(n) = n^3*3^(n-1).
- 2^(n-3)n(9n^2-9n+4).A086604
2^(n-3)n(9n^2-9n+4).
- a(n) = 9*n^3 - 18*n^2 + 10*n.A086605
a(n) = 9*n^3 - 18*n^2 + 10*n.
- Triangle, read by rows, where the n-th row is the first n terms of the n-th self-convolution of the sequence formed by flattening this triangle.A086606
Triangle, read by rows, where the n-th row is the first n terms of the n-th self-convolution of the sequence formed by flattening this triangle.
- Main diagonal of triangle A086606: the n-th term of the n-th self-convolution of the sequence formed by flattening triangle A086606.A086607
Main diagonal of triangle A086606: the n-th term of the n-th self-convolution of the sequence formed by flattening triangle A086606.
- Row sums of triangle A086606: the sum of the first n terms of the n-th self-convolution of the sequence formed by flattening triangle A086606.A086608
Row sums of triangle A086606: the sum of the first n terms of the n-th self-convolution of the sequence formed by flattening triangle A086606.
- Number of primes between consecutive partition numbers.A086609
Number of primes between consecutive partition numbers.
- Triangle of coefficients, read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x) - x^2/(1-x)^2 + xy*f(x,y)^2.A086610
Triangle of coefficients, read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x) - x^2/(1-x)^2 + xy*f(x,y)^2.