Sequences
392,541 sequences
- Smallest number distinct from n, not occurring earlier and having in binary representation not more ones than n.A094511
Smallest number distinct from n, not occurring earlier and having in binary representation not more ones than n.
- Inverse of A094511.A094512
Inverse of A094511.
- A094511(A094511(n)).A094513
A094511(A094511(n)).
- A094512(A094512(n)).A094514
A094512(A094512(n)).
- Consider numbers which are denominators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n (a sequence not yet in the database). Sequence gives denominators which occur more than once.A094515
Consider numbers which are denominators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n (a sequence not yet in the database). Sequence gives denominators which occur more than once.
- Primes p such that q=(p^2+1)/2 is not a prime.A094516
Primes p such that q=(p^2+1)/2 is not a prime.
- Primes p such that 6p+11 is not a prime.A094517
Primes p such that 6p+11 is not a prime.
- Number of pairs (x,y) of divisors of n with x<y such that also x+y is a divisor of n.A094518
Number of pairs (x,y) of divisors of n with x<y such that also x+y is a divisor of n.
- Numbers having at least one pair (x,y) of divisors with x<y such that x+y is also a divisor.A094519
Numbers having at least one pair (x,y) of divisors with x<y such that x+y is also a divisor.
- Numbers such that all sums of two distinct divisors are not divisors.A094520
Numbers such that all sums of two distinct divisors are not divisors.
- a(n) = gcd(n, A094457(n)).A094521
a(n) = gcd(n, A094457(n)).
- a(n) = gcd(n, A064802(n)).A094522
a(n) = gcd(n, A064802(n)).
- Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.A094523
Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.
- Primes of form 3*prime(m) + 2.A094524
Primes of form 3*prime(m) + 2.
- Square array of binomial transforms read by antidiagonals.A094525
Square array of binomial transforms read by antidiagonals.
- Square array of binomial transforms read by antidiagonals.A094526
Square array of binomial transforms read by antidiagonals.
- Triangle T(n,k), read by rows, defined by T(n,k) = binomial(2*n,n-k).A094527
Triangle T(n,k), read by rows, defined by T(n,k) = binomial(2*n,n-k).
- Triangle T(n,k) read by rows related to A004001.A094528
Triangle T(n,k) read by rows related to A004001.
- Numbers with at least one arithmetic progression of four divisors (not necessarily consecutive).A094529
Numbers with at least one arithmetic progression of four divisors (not necessarily consecutive).
- Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).A094530
Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).
- Array read by rows: right-hand side of triangle A027907 of trinomial coefficients.A094531
Array read by rows: right-hand side of triangle A027907 of trinomial coefficients.
- Duplicate of A092980.A094532
Duplicate of A092980.
- Number of one-element transitions among partitions of the integer n for labeled parts.A094533
Number of one-element transitions among partitions of the integer n for labeled parts.
- Centered hexamorphic numbers: the k-th centered hexagonal number, 3k(k-1)+1, ends in k.A094534
Centered hexamorphic numbers: the k-th centered hexagonal number, 3k(k-1)+1, ends in k.
- a(n) is the smallest integer m such that A039995(m)=n.A094535
a(n) is the smallest integer m such that A039995(m)=n.
- Number of binary words of length n that are not "bifix-free".A094536
Number of binary words of length n that are not "bifix-free".
- A094536/2.A094537
A094536/2.
- Number of ternary words of length n that are not "bifix-free".A094538
Number of ternary words of length n that are not "bifix-free".
- a(n) = A094538(n)/3.A094539
a(n) = A094538(n)/3.
- Last digit of the n-th perfect number.A094540
Last digit of the n-th perfect number.
- Numerator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).A094541
Numerator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).
- Denominator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).A094542
Denominator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).
- Smallest perfect power of n containing n in binary representation.A094543
Smallest perfect power of n containing n in binary representation.
- Triangle of a(n,m) = number of m-member minimal T_0-covers of an n-set (n >= 0, 0<= m <=n).A094544
Triangle of a(n,m) = number of m-member minimal T_0-covers of an n-set (n >= 0, 0<= m <=n).
- Number of minimal T_0-covers of an n-set.A094545
Number of minimal T_0-covers of an n-set.
- Number of n-member minimal T_0-covers.A094546
Number of n-member minimal T_0-covers.
- A019309(n)/4 for n >= 1.A094547
A019309(n)/4 for n >= 1.
- Smallest m > n, coprime to n and having as many prime factors as n, with and without repetitions; a(1)=1.A094548
Smallest m > n, coprime to n and having as many prime factors as n, with and without repetitions; a(1)=1.
- Smallest m > n, coprime to n and having as many prime factors as n; a(1)=1.A094549
Smallest m > n, coprime to n and having as many prime factors as n; a(1)=1.
- Numbers n such that there are integers a < b with a+(a+1)+...+(n-1) = (n+1)+(n+2)+...+b.A094550
Numbers n such that there are integers a < b with a+(a+1)+...+(n-1) = (n+1)+(n+2)+...+b.
- Numbers k such that there are integers a < b with a+(a+1)+...+(k-1) = k+(k+1)+...+b.A094551
Numbers k such that there are integers a < b with a+(a+1)+...+(k-1) = k+(k+1)+...+b.
- Numbers n such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = (n+1)^2+(n+2)^2+...+b^2.A094552
Numbers n such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = (n+1)^2+(n+2)^2+...+b^2.
- Numbers n such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.A094553
Numbers n such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.
- Number of closed walks of length n at a base vertex of a truncated tetrahedron (triangular prism).A094554
Number of closed walks of length n at a base vertex of a truncated tetrahedron (triangular prism).
- Number of walks of length n between two vertices on the same triangular face of a truncated tetrahedron (triangular prism).A094555
Number of walks of length n between two vertices on the same triangular face of a truncated tetrahedron (triangular prism).
- Number of walks of length n between opposite vertices on a triangular prism.A094556
Number of walks of length n between opposite vertices on a triangular prism.
- a(2*n) equals coefficient of x^n in A(x)^(n+1) and a(2*n+1) equals coefficient of x^n in A(x)^(n+2), for n>=0.A094557
a(2*n) equals coefficient of x^n in A(x)^(n+1) and a(2*n+1) equals coefficient of x^n in A(x)^(n+2), for n>=0.
- G.f. satisfies A(x) = F(x*A(x)), where F(x) is the g.f. of A094557.A094558
G.f. satisfies A(x) = F(x*A(x)), where F(x) is the g.f. of A094557.
- Number of words of length n over an alphabet of size 4 that are not "bifix-free".A094559
Number of words of length n over an alphabet of size 4 that are not "bifix-free".
- Initial decimal digit of Pi*n, Pi=3.1415...A094560
Initial decimal digit of Pi*n, Pi=3.1415...