Sequences
392,541 sequences
- Triangle a(n,k) (1<=k<=n) of "signed Eulerian numbers" read by rows.A049061
Triangle a(n,k) (1<=k<=n) of "signed Eulerian numbers" read by rows.
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).A049062
Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).
- Triangle a(n,k) (0 <= k <= max(0, 2n-1)) of profile numbers.A049063
Triangle a(n,k) (0 <= k <= max(0, 2n-1)) of profile numbers.
- Describe the previous term in binary (method A - initial term is 0).A049064
Describe the previous term in binary (method A - initial term is 0).
- Record primes reached in A048986.A049065
Record primes reached in A048986.
- Mean prime gaps associated with A049036.A049066
Mean prime gaps associated with A049036.
- LaBar's conjecture (steps to return n to 1 after division by 3 and, if needed, multiplication by 2, addition of 1 or 2).A049067
LaBar's conjecture (steps to return n to 1 after division by 3 and, if needed, multiplication by 2, addition of 1 or 2).
- Complement of quarter-squares (A002620).A049068
Complement of quarter-squares (A002620).
- Array T read by antidiagonals: T(k,n) = k*n*2^(n-1) + 1, n >= 0, k >= 1.A049069
Array T read by antidiagonals: T(k,n) = k*n*2^(n-1) + 1, n >= 0, k >= 1.
- a(n) = (n+1)^2*binomial(2*n+2,n-1)/2.A049070
a(n) = (n+1)^2*binomial(2*n+2,n-1)/2.
- Expansion of x*(3-2*x)/(1-x^2).A049071
Expansion of x*(3-2*x)/(1-x^2).
- Expansion of 1/(1 - 3*x + 4*x^2).A049072
Expansion of 1/(1 - 3*x + 4*x^2).
- LCM of all divisors of d of n such that d+1 is a prime power.A049073
LCM of all divisors of d of n such that d+1 is a prime power.
- Ulam's conjecture (steps to return n to 1 after division by 2 and, if needed, multiplication by 3 with 1 added).A049074
Ulam's conjecture (steps to return n to 1 after division by 2 and, if needed, multiplication by 3 with 1 added).
- Eigensequence of a power series transformation.A049075
Eigensequence of a power series transformation.
- Number of steps in the prime index chain for the n-th prime.A049076
Number of steps in the prime index chain for the n-th prime.
- a(n) = n / gcd(n, binomial(n, floor(n/2))).A049077
a(n) = n / gcd(n, binomial(n, floor(n/2))).
- Primes prime(k) for which A049076(k) = 2.A049078
Primes prime(k) for which A049076(k) = 2.
- Primes prime(k) for which A049076(k) = 3.A049079
Primes prime(k) for which A049076(k) = 3.
- Primes prime(k) for which A049076(k) = 4.A049080
Primes prime(k) for which A049076(k) = 4.
- Primes prime(k) for which A049076(k) = 5.A049081
Primes prime(k) for which A049076(k) = 5.
- Number of putative parameter sets for orthogonal arrays with 2^n runs.A049082
Number of putative parameter sets for orthogonal arrays with 2^n runs.
- Number of dual atoms in lattice Lambda'_{2^n} of putative parameter sets for orthogonal arrays with 2^n runs.A049083
Number of dual atoms in lattice Lambda'_{2^n} of putative parameter sets for orthogonal arrays with 2^n runs.
- a(n) = pi(n) if n is prime, otherwise 0.A049084
a(n) = pi(n) if n is prime, otherwise 0.
- Irregular table T(n,k) = maximal part of the k-th partition of n, when listed in Abramowitz-Stegun order (as in A036043).A049085
Irregular table T(n,k) = maximal part of the k-th partition of n, when listed in Abramowitz-Stegun order (as in A036043).
- Number of tilings of 4 X 3n rectangle by 1 X 3 rectangles. Rotations and reflections are considered distinct tilings.A049086
Number of tilings of 4 X 3n rectangle by 1 X 3 rectangles. Rotations and reflections are considered distinct tilings.
- Ceiling of mean distance between successive distinct prime divisors of n.A049087
Ceiling of mean distance between successive distinct prime divisors of n.
- Number of n X n matrices with nonnegative integer entries and every row and column sum <= 2.A049088
Number of n X n matrices with nonnegative integer entries and every row and column sum <= 2.
- Array read by antidiagonals: T(1,j)=2j+2 i>=1, T(i,1)=2i+2 i>=1, T(i,j)=T(i-1,j-1)+T(i-1,j).A049089
Array read by antidiagonals: T(1,j)=2j+2 i>=1, T(i,1)=2i+2 i>=1, T(i,j)=T(i-1,j-1)+T(i-1,j).
- Primes for which A049076 >= 4.A049090
Primes for which A049076 >= 4.
- Duplicate of A039787.A049091
Duplicate of A039787.
- Primes p such that p-1 is not squarefree.A049092
Primes p such that p-1 is not squarefree.
- Numbers n such that 2^n - 1 is squarefree.A049093
Numbers n such that 2^n - 1 is squarefree.
- Numbers m such that 2^m - 1 is divisible by a square > 1.A049094
Numbers m such that 2^m - 1 is divisible by a square > 1.
- Numbers k such that 2^k + 1 is squarefree.A049095
Numbers k such that 2^k + 1 is squarefree.
- Numbers k such that 2^k + 1 is divisible by a square > 1.A049096
Numbers k such that 2^k + 1 is divisible by a square > 1.
- Primes p such that p+1 is squarefree.A049097
Primes p such that p+1 is squarefree.
- Primes p such that p+1 is divisible by a square.A049098
Primes p such that p+1 is divisible by a square.
- a(n) = Euler phi function applied thrice to n.A049099
a(n) = Euler phi function applied thrice to n.
- a(n) = Euler phi function applied 4 times to n.A049100
a(n) = Euler phi function applied 4 times to n.
- Numbers m such that m divides (product of digits of m) * (sum of digits of m).A049101
Numbers m such that m divides (product of digits of m) * (sum of digits of m).
- Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).A049102
Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).
- Numbers k such that k and k+1 both have 6 divisors.A049103
Numbers k such that k and k+1 both have 6 divisors.
- Numbers k such that k and k-1 both have 6 divisors.A049104
Numbers k such that k and k-1 both have 6 divisors.
- Ratio from A049101.A049105
Ratio from A049101.
- Ratio from A049102.A049106
Ratio from A049102.
- a(n) = Euler phi function applied 5 times to n.A049107
a(n) = Euler phi function applied 5 times to n.
- a(n) is the number of iterations of Euler phi function needed to reach 1 starting at n (n is counted).A049108
a(n) is the number of iterations of Euler phi function needed to reach 1 starting at n (n is counted).
- Number of divisors of A005238(n).A049109
Number of divisors of A005238(n).
- Number of divisors of A006601(n).A049110
Number of divisors of A006601(n).