Sequences
392,541 sequences
- Indices of Wonderful Demlo numbers A002477 whose digit sums are squares.A080161
Indices of Wonderful Demlo numbers A002477 whose digit sums are squares.
- Wonderful Demlo numbers A002477 whose digit sums are squares.A080162
Wonderful Demlo numbers A002477 whose digit sums are squares.
- Sum of an infinite series: a(n) = Sum_{k>=0} ((k+1)*(k+2))^n/(16*(2^k)).A080163
Sum of an infinite series: a(n) = Sum_{k>=0} ((k+1)*(k+2))^n/(16*(2^k)).
- Wythoff difference array, D={d(i,j)}, by antidiagonals.A080164
Wythoff difference array, D={d(i,j)}, by antidiagonals.
- Primes having initial digits "10" in binary representation.A080165
Primes having initial digits "10" in binary representation.
- Primes having initial digits "11" in their binary representation.A080166
Primes having initial digits "11" in their binary representation.
- Primes beginning with '10' and ending with '01' in binary representation.A080167
Primes beginning with '10' and ending with '01' in binary representation.
- Primes beginning and ending with '11' in binary representation.A080168
Primes beginning and ending with '11' in binary representation.
- Numbers that are cubes of primes of the form 4k+1 (A002144).A080169
Numbers that are cubes of primes of the form 4k+1 (A002144).
- Numbers k such that gcd(C(2*k,k), C(3*k,k), C(4*k,k), ..., C((k+1)*k,k) ) = 1.A080170
Numbers k such that gcd(C(2*k,k), C(3*k,k), C(4*k,k), ..., C((k+1)*k,k) ) = 1.
- a(n) = n*a(n-1) - (n-1)^2*a(n-2), a(0)=1, a(1)=1.A080171
a(n) = n*a(n-1) - (n-1)^2*a(n-2), a(0)=1, a(1)=1.
- Final digit of n-th Mersenne prime A000668(n).A080172
Final digit of n-th Mersenne prime A000668(n).
- Final 2 digits of n-th Mersenne prime A000668(n).A080173
Final 2 digits of n-th Mersenne prime A000668(n).
- Primes prime(k) such that prime(k)*k falls between twin primes.A080174
Primes prime(k) such that prime(k)*k falls between twin primes.
- Fourth power of primes of the form 4k+1 (A002144).A080175
Fourth power of primes of the form 4k+1 (A002144).
- Generalized Fermat numbers: 10^(2^n) + 1, n >= 0.A080176
Generalized Fermat numbers: 10^(2^n) + 1, n >= 0.
- Non-palindromic primes which on subtracting their reversal give perfect squares.A080177
Non-palindromic primes which on subtracting their reversal give perfect squares.
- Non-palindromic primes which on subtracting their reversal gives perfect cubes.A080178
Non-palindromic primes which on subtracting their reversal gives perfect cubes.
- Numbers which on adding their reversal gives perfect cubes.A080179
Numbers which on adding their reversal gives perfect cubes.
- a(1)=1, a(n+1) = a(n) + spf(Sum_{i=1..n} a(i)), where spf=A020639 (smallest prime factor).A080180
a(1)=1, a(n+1) = a(n) + spf(Sum_{i=1..n} a(i)), where spf=A020639 (smallest prime factor).
- Partial sums of A080180.A080181
Partial sums of A080180.
- a(1) = 1, a(n+1) = a(n) + gpf(Sum_{i=1..n} a(i)), where gpf=A006530 (greatest prime factor).A080182
a(1) = 1, a(n+1) = a(n) + gpf(Sum_{i=1..n} a(i)), where gpf=A006530 (greatest prime factor).
- Partial sums of A080182.A080183
Partial sums of A080182.
- Duplicate of A052248.A080184
Duplicate of A052248.
- Primes p such that 5 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).A080185
Primes p such that 5 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).
- Primes p such that 7 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).A080186
Primes p such that 7 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).
- Primes p such that 11 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).A080187
Primes p such that 11 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).
- Primes p such that 13 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).A080188
Primes p such that 13 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).
- a(n) = k such that f^k(prime(n)) = 2, where f is the mapping of primes > 2 to primes defined by A052248.A080189
a(n) = k such that f^k(prime(n)) = 2, where f is the mapping of primes > 2 to primes defined by A052248.
- Smallest prime p such that n applications of f lead form p to 2, where f is the mapping of primes > 2 to primes defined by A052248.A080190
Smallest prime p such that n applications of f lead form p to 2, where f is the mapping of primes > 2 to primes defined by A052248.
- Primes p such that p is the largest of all prime factors of the numbers between the prime preceding 2*p and the next prime.A080191
Primes p such that p is the largest of all prime factors of the numbers between the prime preceding 2*p and the next prime.
- Complement of A080191 relative to A000040. Prime p is a term iff there is no prime between 2*p and 2*q, where q is the next prime after p.A080192
Complement of A080191 relative to A000040. Prime p is a term iff there is no prime between 2*p and 2*q, where q is the next prime after p.
- 5-smooth numbers which are not 3-smooth.A080193
5-smooth numbers which are not 3-smooth.
- 7-smooth numbers which are not 5-smooth.A080194
7-smooth numbers which are not 5-smooth.
- 11-smooth numbers which are not 7-smooth.A080195
11-smooth numbers which are not 7-smooth.
- 13-smooth numbers which are not 11-smooth.A080196
13-smooth numbers which are not 11-smooth.
- 13-smooth numbers: numbers whose prime divisors are all <= 13.A080197
13-smooth numbers: numbers whose prime divisors are all <= 13.
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.A080198
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=5/4.
- a(1)=1; for n>1, a(n)=a(n-1) - 3 if n is already in the sequence, a(n)=a(n-1) + 6 otherwise.A080199
a(1)=1; for n>1, a(n)=a(n-1) - 3 if n is already in the sequence, a(n)=a(n-1) + 6 otherwise.
- Numbers that do not occur as differences between terms of the Mian-Chowla sequence A005282.A080200
Numbers that do not occur as differences between terms of the Mian-Chowla sequence A005282.
- Numbers that do not occur as differences between terms of the Mian-Chowla variant A051788.A080201
Numbers that do not occur as differences between terms of the Mian-Chowla variant A051788.
- Triangle T(b,k) read by rows, giving numbers of pairs of unequal permutations of all the digits 1, ..., k in base b (k<b) whose ratio is an integer.A080202
Triangle T(b,k) read by rows, giving numbers of pairs of unequal permutations of all the digits 1, ..., k in base b (k<b) whose ratio is an integer.
- Steffi sequence; the numbers of pairs of unequal permutations of all the digits 1, ..., b-1 in base b whose ratio is an integer.A080203
Steffi sequence; the numbers of pairs of unequal permutations of all the digits 1, ..., b-1 in base b whose ratio is an integer.
- Number of fixed points under n-fold inflation for the substitution rule a->abc, b->ab, c->b that underlies the Kolakoski (3,1) sequence.A080204
Number of fixed points under n-fold inflation for the substitution rule a->abc, b->ab, c->b that underlies the Kolakoski (3,1) sequence.
- Maximal number of rational points that a (smooth, geometrically irreducible) curve of genus 3 over the finite field GF(n) can have, or 0 if n is not a prime power.A080205
Maximal number of rational points that a (smooth, geometrically irreducible) curve of genus 3 over the finite field GF(n) can have, or 0 if n is not a prime power.
- a(1)=a(2)=a(3)=1; a(n)=|a(n-2)+a(n-3)|-2*a(n-1).A080206
a(1)=a(2)=a(3)=1; a(n)=|a(n-2)+a(n-3)|-2*a(n-1).
- Let F(x) = 1 + x + 4x^2 + 9x^3 + ... = g.f. for A002835 (solid partitions restricted to two planes) and write F(x) = 1/Product_{n>=1} (1-x^n)^a(n).A080207
Let F(x) = 1 + x + 4x^2 + 9x^3 + ... = g.f. for A002835 (solid partitions restricted to two planes) and write F(x) = 1/Product_{n>=1} (1-x^n)^a(n).
- a(n) is the least k such that the generalized Fermat number (k+1)^(2^n) + k^(2^n) is prime.A080208
a(n) is the least k such that the generalized Fermat number (k+1)^(2^n) + k^(2^n) is prime.
- Gilbreath transform of the sequence of Sophie Germain primes (A005384), i.e., the diagonal of leading successive absolute differences of A005384.A080209
Gilbreath transform of the sequence of Sophie Germain primes (A005384), i.e., the diagonal of leading successive absolute differences of A005384.
- Lower bound for the multiplicity of a disjoint covering system of congruences.A080210
Lower bound for the multiplicity of a disjoint covering system of congruences.