Sequences
392,541 sequences
- Sixth column of triangle A075497.A075511
Sixth column of triangle A075497.
- Seventh column of triangle A075497.A075512
Seventh column of triangle A075497.
- Triangle read by rows. T(n, m) are the coefficients of Sidi polynomials.A075513
Triangle read by rows. T(n, m) are the coefficients of Sidi polynomials.
- a(0)=1; for n > 0, a(n)=sum(binomial(n,k)*(binomial(n+k,k+1)^2)* binomial(n+k,k),k=0..n).A075514
a(0)=1; for n > 0, a(n)=sum(binomial(n,k)*(binomial(n+k,k+1)^2)* binomial(n+k,k),k=0..n).
- Fifth column of triangle A075498.A075515
Fifth column of triangle A075498.
- Sixth column of triangle A075498.A075516
Sixth column of triangle A075498.
- Created by removing all integers which take an odd number of nested digit sums to reach <10.A075517
Created by removing all integers which take an odd number of nested digit sums to reach <10.
- a(n) = floor(prime(n)/4).A075518
a(n) = floor(prime(n)/4).
- Primes p such that floor(p/4) is prime.A075519
Primes p such that floor(p/4) is prime.
- 4*prime(n) + (prime(n) mod 4).A075520
4*prime(n) + (prime(n) mod 4).
- Primes p such that 4*p + (p mod 4) is also a prime.A075521
Primes p such that 4*p + (p mod 4) is also a prime.
- Number of steps to reach the first nonprime (=A075523(n)) starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.A075522
Number of steps to reach the first nonprime (=A075523(n)) starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.
- First nonprime reached when starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.A075523
First nonprime reached when starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.
- Nonprimes of form 4*p + (p mod 4), p prime.A075524
Nonprimes of form 4*p + (p mod 4), p prime.
- Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*t^n/n! = ((1+t)*(1+t^2)*(1+t^3)...)^u.A075525
Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*t^n/n! = ((1+t)*(1+t^2)*(1+t^3)...)^u.
- a(n) = A008578(n+2) - A008578(n+1).A075526
a(n) = A008578(n+2) - A008578(n+1).
- a(n) = A008578(n+3) - A008578(n+1).A075527
a(n) = A008578(n+3) - A008578(n+1).
- Triangular numbers that are half other triangular numbers.A075528
Triangular numbers that are half other triangular numbers.
- Let x(0),...,x(n), be an additive chain of length n+1 with x(0)=1 and satisfying x(k) = x(k-1) + x(j) for some j < k. a(n) is the number of distinct possible values taken on by x(n).A075529
Let x(0),...,x(n), be an additive chain of length n+1 with x(0)=1 and satisfying x(k) = x(k-1) + x(j) for some j < k. a(n) is the number of distinct possible values taken on by x(n).
- a(n) is the largest m such that n+1, n+2, ..., n+m are all members of the set X(n) given in A075529.A075530
a(n) is the largest m such that n+1, n+2, ..., n+m are all members of the set X(n) given in A075529.
- Number of gaps in the set of all possible values in the set X(n) given in A075529.A075531
Number of gaps in the set of all possible values in the set X(n) given in A075529.
- Number of rooted trees where each node at height h has 0 or h+1 children.A075532
Number of rooted trees where each node at height h has 0 or h+1 children.
- Number of labeled rooted trees where each node at height h has 0 or h+1 children.A075533
Number of labeled rooted trees where each node at height h has 0 or h+1 children.
- Number of increasing rooted trees where each node at height h has 0 or h+1 children.A075534
Number of increasing rooted trees where each node at height h has 0 or h+1 children.
- a(1)=1, a(n) = Sum_{k=1..n-1} min(a(k), a(n-k)).A075535
a(1)=1, a(n) = Sum_{k=1..n-1} min(a(k), a(n-k)).
- a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.A075536
a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.
- a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(n-2),a(n-1))-a(n-2)-a(n-1).A075537
a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(n-2),a(n-1))-a(n-2)-a(n-1).
- a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(1),...,a(n-1))-a(1)-...-a(n-1).A075538
a(1)=1, a(2)=2, then use "merge and minus": a(n)=merge(a(1),...,a(n-1))-a(1)-...-a(n-1).
- Perfect powers n such that (n-5)/2 is prime.A075539
Perfect powers n such that (n-5)/2 is prime.
- Integers that are the average of three successive primes.A075540
Integers that are the average of three successive primes.
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a multiple of 3.A075541
Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a multiple of 3.
- Duplicate of A064113.A075542
Duplicate of A064113.
- a(n) = a(n-1) + digit sum(n + 2) with a(0) = 2.A075543
a(n) = a(n-1) + digit sum(n + 2) with a(0) = 2.
- Primes which are the sum of the digital root of the first n primes for some n.A075544
Primes which are the sum of the digital root of the first n primes for some n.
- Number of connected circulant graphs on n nodes.A075545
Number of connected circulant graphs on n nodes.
- Perfect powers n such that (n-9)/2 is prime.A075546
Perfect powers n such that (n-9)/2 is prime.
- Perfect powers n such that (n-13)/2 is prime.A075547
Perfect powers n such that (n-13)/2 is prime.
- Perfect powers n such that (n-17)/2 is prime.A075548
Perfect powers n such that (n-17)/2 is prime.
- Decimal expansion of 9 - 12*log(2).A075549
Decimal expansion of 9 - 12*log(2).
- Irredundance number for kings graph K(n).A075550
Irredundance number for kings graph K(n).
- Primes generated in A074311.A075551
Primes generated in A074311.
- Primes generated in A073628.A075552
Primes generated in A073628.
- Numerators in the Maclaurin series for arctan(1+x).A075553
Numerators in the Maclaurin series for arctan(1+x).
- Denominators in the Maclaurin series for arctan(1+x).A075554
Denominators in the Maclaurin series for arctan(1+x).
- Smallest prime p such that p+n is a square, or 0 if no such p exists.A075555
Smallest prime p such that p+n is a square, or 0 if no such p exists.
- Smallest prime p not occurring earlier such that p+n is a square, or 0 if no such p exists.A075556
Smallest prime p not occurring earlier such that p+n is a square, or 0 if no such p exists.
- a(n) is the smallest odd prime such that (1) a(n) doesn't already appear in the sequence; (2) the n-th partial sum is divisible by n; and (3) the n-th partial sum is relatively prime to n+1.A075557
a(n) is the smallest odd prime such that (1) a(n) doesn't already appear in the sequence; (2) the n-th partial sum is divisible by n; and (3) the n-th partial sum is relatively prime to n+1.
- a(n) is the least composite number that has not yet appeared such that the n-th partial sum is a multiple of the n-th prime.A075558
a(n) is the least composite number that has not yet appeared such that the n-th partial sum is a multiple of the n-th prime.
- Smallest multiple of n not equal to n ending in (digits of) n.A075559
Smallest multiple of n not equal to n ending in (digits of) n.
- a(1) = 1, a(n) is the smallest number greater than the previous term that cannot be obtained as the sum of products of any group of earlier terms.A075560
a(1) = 1, a(n) is the smallest number greater than the previous term that cannot be obtained as the sum of products of any group of earlier terms.