Sequences
392,541 sequences
- Denominators of w(n) equals 3 where w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).A072561
Denominators of w(n) equals 3 where w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).
- Smallest of exactly n consecutive integers divisible respectively by the first n primes.A072562
Smallest of exactly n consecutive integers divisible respectively by the first n primes.
- 9*w(n) where : w(1)=w(2)=w(3)=1 w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).A072563
9*w(n) where : w(1)=w(2)=w(3)=1 w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).
- Numbers m such that the absolute values of the real and imaginary part of zeta(1/2 + m*i) are both < 1.A072564
Numbers m such that the absolute values of the real and imaginary part of zeta(1/2 + m*i) are both < 1.
- a(n) = prime(n+1)*prime(n+2)+1 mod prime(n), where prime(n) is the n-th prime.A072565
a(n) = prime(n+1)*prime(n+2)+1 mod prime(n), where prime(n) is the n-th prime.
- Numbers n such that n and sigma(n) end with the same digit in base 10.A072566
Numbers n such that n and sigma(n) end with the same digit in base 10.
- A variant of Zarankiewicz problem: maximal number of 1s in n X n 01-matrix with no four 1s forming a rectangle.A072567
A variant of Zarankiewicz problem: maximal number of 1s in n X n 01-matrix with no four 1s forming a rectangle.
- Even interprimes.A072568
Even interprimes.
- Odd interprimes.A072569
Odd interprimes.
- Even interprimes i = (p+q)/2 (where p, q are consecutive primes) such that (q-p)/2 is not divisible by 3.A072570
Even interprimes i = (p+q)/2 (where p, q are consecutive primes) such that (q-p)/2 is not divisible by 3.
- Even interprimes i = (p+q)/2 (where p, q are consecutive primes) such that (q-p)/2 is divisible by 3.A072571
Even interprimes i = (p+q)/2 (where p, q are consecutive primes) such that (q-p)/2 is divisible by 3.
- Odd interprimes divisible by 3.A072572
Odd interprimes divisible by 3.
- Odd interprimes not divisible by 3.A072573
Odd interprimes not divisible by 3.
- Triangle T(n,k) of number of compositions (ordered partitions) of n into exactly k distinct parts, 1<=k<=n.A072574
Triangle T(n,k) of number of compositions (ordered partitions) of n into exactly k distinct parts, 1<=k<=n.
- Triangle T(n,k) of number of compositions (ordered partitions) of n into distinct parts where largest part is exactly k, 1<=k<=n.A072575
Triangle T(n,k) of number of compositions (ordered partitions) of n into distinct parts where largest part is exactly k, 1<=k<=n.
- Limit of number of compositions (ordered partitions) of m into distinct parts where largest part is exactly m-n, for m sufficiently large given n.A072576
Limit of number of compositions (ordered partitions) of m into distinct parts where largest part is exactly m-n, for m sufficiently large given n.
- Numbers k such that k and the k-th prime have the same number of 0's in their binary representation.A072577
Numbers k such that k and the k-th prime have the same number of 0's in their binary representation.
- In binary representation: k has the same number of 0's as the k-th prime has 1's.A072578
In binary representation: k has the same number of 0's as the k-th prime has 1's.
- In binary representation: k has the same number of 1's as the k-th prime has 0's.A072579
In binary representation: k has the same number of 1's as the k-th prime has 0's.
- a(n) = A000040(A072577(n)).A072580
a(n) = A000040(A072577(n)).
- a(n) = A000040(A072578(n)).A072581
a(n) = A000040(A072578(n)).
- a(n) = A000040(A072579(n)).A072582
a(n) = A000040(A072579(n)).
- Numbers k with the property that there is no match when comparing the numbers of 0's and 1's in the binary representations of k and the k-th prime.A072583
Numbers k with the property that there is no match when comparing the numbers of 0's and 1's in the binary representations of k and the k-th prime.
- a(n) = A000040(A072583(n)).A072584
a(n) = A000040(A072583(n)).
- Numbers k such that k and phi(k) end with the same digit in base 10.A072585
Numbers k such that k and phi(k) end with the same digit in base 10.
- Number of numbers <= n having prime factors with odd exponents only.A072586
Number of numbers <= n having prime factors with odd exponents only.
- Numbers having at least one prime factor with an even exponent.A072587
Numbers having at least one prime factor with an even exponent.
- Numbers having at least one prime factor with an odd and one with an even exponent.A072588
Numbers having at least one prime factor with an odd and one with an even exponent.
- n, phi(n) and sigma(n) end with the same digit.A072589
n, phi(n) and sigma(n) end with the same digit.
- Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.A072590
Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.
- In prime factorization of n replace multiplication with bitwise logical 'and'.A072591
In prime factorization of n replace multiplication with bitwise logical 'and'.
- Even numbers with at least one prime factor of form 4*k+1.A072592
Even numbers with at least one prime factor of form 4*k+1.
- In prime factorization of n replace multiplication with bitwise logical 'or'.A072593
In prime factorization of n replace multiplication with bitwise logical 'or'.
- In prime factorization of n replace multiplication with bitwise logical 'xor'.A072594
In prime factorization of n replace multiplication with bitwise logical 'xor'.
- Numbers k such that A072594(k) = 0.A072595
Numbers k such that A072594(k) = 0.
- Nonsquares with A072594(n) = 0.A072596
Nonsquares with A072594(n) = 0.
- Expansion of 1/(exp(-x) - x) as exponential generating function.A072597
Expansion of 1/(exp(-x) - x) as exponential generating function.
- a(n)= 3^(4*n-4)* Sum_{k>=0} ( Gamma(n+k/3+1/3) / Gamma(4/3+k/3) ) * (Gamma(n+k/3+2/3) / Gamma(5/3+k/3) ) * (Gamma(n+k/3+1) / Gamma(2+k/3) ) * Gamma(n+k/3+4/3) / ( Gamma(7/3+k/3) * k! *exp(1)).A072598
a(n)= 3^(4*n-4)* Sum_{k>=0} ( Gamma(n+k/3+1/3) / Gamma(4/3+k/3) ) * (Gamma(n+k/3+2/3) / Gamma(5/3+k/3) ) * (Gamma(n+k/3+1) / Gamma(2+k/3) ) * Gamma(n+k/3+4/3) / ( Gamma(7/3+k/3) * k! *exp(1)).
- Numbers n such that (n!)^2 - prime(n) is prime.A072599
Numbers n such that (n!)^2 - prime(n) is prime.
- Numbers which in base 2 have fewer 0's than 1's.A072600
Numbers which in base 2 have fewer 0's than 1's.
- Numbers which in base 2 have at least as many 1's as 0's.A072601
Numbers which in base 2 have at least as many 1's as 0's.
- Numbers such that in base 2 the number of 0's is >= the number of 1's.A072602
Numbers such that in base 2 the number of 0's is >= the number of 1's.
- Numbers which in base 2 have more 0's than 1's.A072603
Numbers which in base 2 have more 0's than 1's.
- Last digit of n, phi(n) and sigma(n) is 0 in base 10.A072604
Last digit of n, phi(n) and sigma(n) is 0 in base 10.
- Number of necklaces with n beads over an n-ary alphabet {a1,a2,...,an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 0, where #(w,x) counts the letters x in word w.A072605
Number of necklaces with n beads over an n-ary alphabet {a1,a2,...,an} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 0, where #(w,x) counts the letters x in word w.
- Number of pretzel (stellar or prismatic) knots and links.A072606
Number of pretzel (stellar or prismatic) knots and links.
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.A072607
If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.
- Parity of remainder Mod(prime(n),n) = A004648(n).A072608
Parity of remainder Mod(prime(n),n) = A004648(n).
- Changing of parity of remainder A072608(n) from alternation [..010101..] to steadily 1-range [...1111..]. AC-range corresponds to 0, while DC-range labeled by 1.A072609
Changing of parity of remainder A072608(n) from alternation [..010101..] to steadily 1-range [...1111..]. AC-range corresponds to 0, while DC-range labeled by 1.
- Values of transition of A072608(n) from alternating behavior (0,1,0,1,..) into steadily-1 (1,1,1,..) behavior or changing back. Expressing in terms of A072609(n): at n values it switches from steadily 0 into steadily 1 successive values or back.A072610
Values of transition of A072608(n) from alternating behavior (0,1,0,1,..) into steadily-1 (1,1,1,..) behavior or changing back. Expressing in terms of A072609(n): at n values it switches from steadily 0 into steadily 1 successive values or back.