Sequences
392,541 sequences
- a(1) = 1; a(n) = smallest positive unpicked integer such that n-k divides evenly into a(n)*a(k) for every k, 1 <= k <= n-1.A091861
a(1) = 1; a(n) = smallest positive unpicked integer such that n-k divides evenly into a(n)*a(k) for every k, 1 <= k <= n-1.
- a(n) = 1 if the sum of all exponents of the prime-factorization of n has no carries when summed in base 2, or a(n) = 0 if there are any carries.A091862
a(n) = 1 if the sum of all exponents of the prime-factorization of n has no carries when summed in base 2, or a(n) = 0 if there are any carries.
- Partial sums of A091862.A091863
Partial sums of A091862.
- Positive integers n such that Sum_{p<=pi(n)} p = n, where pi(x) denotes the number of primes not exceeding x and the summation is over primes p.A091864
Positive integers n such that Sum_{p<=pi(n)} p = n, where pi(x) denotes the number of primes not exceeding x and the summation is over primes p.
- G.f. satisfies A(x) = 1 + x*A(x)*A(x^2)*A(x^3)*...*A(x^n)*...A091865
G.f. satisfies A(x) = 1 + x*A(x)*A(x^2)*A(x^3)*...*A(x^n)*...
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having pyramid weight k.A091866
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having pyramid weight k.
- Triangle read by rows: T(n,k) = number of Dyck paths of semilength n having k peaks at odd height.A091867
Triangle read by rows: T(n,k) = number of Dyck paths of semilength n having k peaks at odd height.
- a(n) = (n!)^(n+1).A091868
a(n) = (n!)^(n+1).
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks at even height.A091869
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks at even height.
- A trinomial transform of Fibonacci(3n).A091870
A trinomial transform of Fibonacci(3n).
- A091633 indexed by A000040.A091871
A091633 indexed by A000040.
- Primes arising in A086678.A091872
Primes arising in A086678.
- Square roots of A068165.A091873
Square roots of A068165.
- Duplicate of A067633.A091874
Duplicate of A067633.
- Square roots of squares in A068176.A091875
Square roots of squares in A068176.
- Square roots of squares in A068177.A091876
Square roots of squares in A068177.
- Square roots of A068178.A091877
Square roots of A068178.
- a(n) can be expressed as the difference of the squares of consecutive primes in just four distinct ways.A091878
a(n) can be expressed as the difference of the squares of consecutive primes in just four distinct ways.
- Sequence of k values arising in A091771.A091879
Sequence of k values arising in A091771.
- A049232 indexed by A000040.A091880
A049232 indexed by A000040.
- Expansion of (1-11x)/((1-x)(1-16x)).A091881
Expansion of (1-11x)/((1-x)(1-16x)).
- Expansion of g.f. (1-10x)/(1-15x).A091882
Expansion of g.f. (1-10x)/(1-15x).
- Expansion of (1-5x)/((1+5x)(1-10x)).A091883
Expansion of (1-5x)/((1+5x)(1-10x)).
- Triangle of numbers defined by Knuth.A091884
Triangle of numbers defined by Knuth.
- Triangle T(n,k) defined by the generating function cosh(sqrt(y)*arcsin(x)) + sqrt(y)*sinh(sqrt(y)*arcsin(x)) - 1 = Sum_{n>=1} Sum_{k=1..n} T(n,k)*y^k *x^n/n!.A091885
Triangle T(n,k) defined by the generating function cosh(sqrt(y)*arcsin(x)) + sqrt(y)*sinh(sqrt(y)*arcsin(x)) - 1 = Sum_{n>=1} Sum_{k=1..n} T(n,k)*y^k *x^n/n!.
- Values of k such that PrimePi(k)^2 < (e*k*PrimePi(k/e))/log(k), where e = 2.71828... (A001113).A091886
Values of k such that PrimePi(k)^2 < (e*k*PrimePi(k/e))/log(k), where e = 2.71828... (A001113).
- Irregularity index of the n-th irregular prime A000928(n).A091887
Irregularity index of the n-th irregular prime A000928(n).
- Irregularity index of prime(n): number of numbers k, 1 <= k <= (p-3)/2, such that p = prime(n) divides the numerator of the Bernoulli number B(2k).A091888
Irregularity index of prime(n): number of numbers k, 1 <= k <= (p-3)/2, such that p = prime(n) divides the numerator of the Bernoulli number B(2k).
- Number of partitions of n into sums of exactly two distinct powers of 2.A091889
Number of partitions of n into sums of exactly two distinct powers of 2.
- Number of partitions of n into sums of exactly three distinct powers of 2.A091890
Number of partitions of n into sums of exactly three distinct powers of 2.
- Number of partitions of n into parts which are a sum of exactly as many distinct powers of 2 as n has 1's in its binary representation.A091891
Number of partitions of n into parts which are a sum of exactly as many distinct powers of 2 as n has 1's in its binary representation.
- Numbers k having only one partition into parts which are a sum of exactly as many distinct powers of 2 as there are 1's in the binary representation of k.A091892
Numbers k having only one partition into parts which are a sum of exactly as many distinct powers of 2 as there are 1's in the binary representation of k.
- Number of partitions of n into numbers having all the same number of 1's in binary representation.A091893
Number of partitions of n into numbers having all the same number of 1's in binary representation.
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u = (1,1) and d = (1,-1)].A091894
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u = (1,1) and d = (1,-1)].
- Least number k such that the denominator of d(k)/k = n, or zero if no such number exists, where d is the number-of-divisors function A000005.A091895
Least number k such that the denominator of d(k)/k = n, or zero if no such number exists, where d is the number-of-divisors function A000005.
- Numbers n such that there exists no k for which the denominator of d(k)/k is n, where d = A000005 is the number-of-divisors function.A091896
Numbers n such that there exists no k for which the denominator of d(k)/k is n, where d = A000005 is the number-of-divisors function.
- Numbers that remain prime or composite for all permutations of their digits.A091897
Numbers that remain prime or composite for all permutations of their digits.
- Numbers that change from composite to prime or vice versa for at least one permutation of their digits.A091898
Numbers that change from composite to prime or vice versa for at least one permutation of their digits.
- Decimal expansion of (1+sqrt(5)+sqrt(2*(5+sqrt(5))))/(2*e^((2*Pi)/5)).A091899
Decimal expansion of (1+sqrt(5)+sqrt(2*(5+sqrt(5))))/(2*e^((2*Pi)/5)).
- Decimal expansion of 1/(exp(2*Pi/sqrt(5))*(sqrt(5)/(1+(5^(3/4)*(phi-1)^(5/2)-1)^(1/5))-phi)).A091900
Decimal expansion of 1/(exp(2*Pi/sqrt(5))*(sqrt(5)/(1+(5^(3/4)*(phi-1)^(5/2)-1)^(1/5))-phi)).
- Values of n for which sigma(n) < e^gamma * n * log(log(n)).A091901
Values of n for which sigma(n) < e^gamma * n * log(log(n)).
- Erroneous version of A067698.A091902
Erroneous version of A067698.
- Expansion of x/((1+5x)(1-10x)).A091903
Expansion of x/((1+5x)(1-10x)).
- Expansion of x/((1+4x)(1-8x)).A091904
Expansion of x/((1+4x)(1-8x)).
- Expansion of (1-4x)/((1+4x)(1-8x)).A091905
Expansion of (1-4x)/((1+4x)(1-8x)).
- E.g.f.: exp(1-sqrt(3-2*exp(x))).A091906
E.g.f.: exp(1-sqrt(3-2*exp(x))).
- Numbers k such that (2*k)!/(2*k!)-1 is prime.A091907
Numbers k such that (2*k)!/(2*k!)-1 is prime.
- Number of interior intersection points made by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces, counting coinciding intersection points only once.A091908
Number of interior intersection points made by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces, counting coinciding intersection points only once.
- Numbers n such that (2*n)!/(2*n!)+1 is prime.A091909
Numbers n such that (2*n)!/(2*n!)+1 is prime.
- Number of distinct distances between the intersection points in A091908 measured from the center of the equilateral triangle.A091910
Number of distinct distances between the intersection points in A091908 measured from the center of the equilateral triangle.