Sequences
392,541 sequences
- cototient(x) - 1 where x are the odd semiprimes (i.e., x are odd terms in A001358).A073411
cototient(x) - 1 where x are the odd semiprimes (i.e., x are odd terms in A001358).
- Lesser of three consecutive nonsquare integers each of which is the sum of two squares.A073412
Lesser of three consecutive nonsquare integers each of which is the sum of two squares.
- Numbers n such that number of divisors of n divides S(n), the Kempner function A002034.A073413
Numbers n such that number of divisors of n divides S(n), the Kempner function A002034.
- Numerator of the n-th convergent to Sum_{k>=0} 1/2^(2^k).A073414
Numerator of the n-th convergent to Sum_{k>=0} 1/2^(2^k).
- Denominator of the n-th convergent to Sum_{k>=0} 1/2^(2^k).A073415
Denominator of the n-th convergent to Sum_{k>=0} 1/2^(2^k).
- Harmless numbers: numbers without a, h, m or r.A073416
Harmless numbers: numbers without a, h, m or r.
- Flawless numbers: numbers without a, f, l or w.A073417
Flawless numbers: numbers without a, f, l or w.
- Useless numbers: numbers written in English without any of the letters e, s or u.A073418
Useless numbers: numbers written in English without any of the letters e, s or u.
- Worthless numbers: numbers without h, o, r, t, or w.A073419
Worthless numbers: numbers without h, o, r, t, or w.
- G.f.: 1/B(x) where B(x) = g.f. for A072964.A073420
G.f.: 1/B(x) where B(x) = g.f. for A072964.
- Roman numerals for n evaluated as if in base 36.A073421
Roman numerals for n evaluated as if in base 36.
- e = 1/a(0)+1/a(1)+1/a(2)+1/a(3)+... with each term a(n) being a positive or negative integer chosen so as to minimize the absolute difference between e and the partial sum.A073422
e = 1/a(0)+1/a(1)+1/a(2)+1/a(3)+... with each term a(n) being a positive or negative integer chosen so as to minimize the absolute difference between e and the partial sum.
- Sums of two powers of zero: triangle read by rows: T(m,n) = 0^n + 0^m, n >= 0, m = 0..n.A073423
Sums of two powers of zero: triangle read by rows: T(m,n) = 0^n + 0^m, n >= 0, m = 0..n.
- Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.A073424
Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.
- a(0)=0; for n>0, a(n) = number of primes not exceeding n-th composite number.A073425
a(0)=0; for n>0, a(n) = number of primes not exceeding n-th composite number.
- Number of primes between n-th prime and n-th composite or number of primes that are >=Min[prime(n),c(n)] and are < Max[prime(n),c(n)].A073426
Number of primes between n-th prime and n-th composite or number of primes that are >=Min[prime(n),c(n)] and are < Max[prime(n),c(n)].
- Roman numerals for n evaluated as if in Sallows' base 27.A073427
Roman numerals for n evaluated as if in Sallows' base 27.
- First n-digit prime in the concatenation of odd integers forbidding leading zeros.A073428
First n-digit prime in the concatenation of odd integers forbidding leading zeros.
- Upper triangular region of the table A073345.A073429
Upper triangular region of the table A073345.
- Upper triangular region of the table A073346.A073430
Upper triangular region of the table A073346.
- Number of separate orbits/cycles to which the Catalan bijections A069767/A069768 partition each A000108(n) structures encoded in the range [A014137(n-1)..A014138(n-1)] of the sequence A014486/A063171.A073431
Number of separate orbits/cycles to which the Catalan bijections A069767/A069768 partition each A000108(n) structures encoded in the range [A014137(n-1)..A014138(n-1)] of the sequence A014486/A063171.
- Numbers n such that prime(n) + composite(n) is even.A073432
Numbers n such that prime(n) + composite(n) is even.
- Value of [p(n)+c(n)]/2 when it is an integer; p(n) is n-th prime, c(n) is n-th composite.A073433
Value of [p(n)+c(n)]/2 when it is an integer; p(n) is n-th prime, c(n) is n-th composite.
- Primes p such that 2p+1 is prime and there are an even number of primes in the interval [p+1,2p+1].A073434
Primes p such that 2p+1 is prime and there are an even number of primes in the interval [p+1,2p+1].
- Smallest x such that remainder if x-th composite is divided by pi(x) equals n.A073435
Smallest x such that remainder if x-th composite is divided by pi(x) equals n.
- Smallest k such that k mod pi(k) = n.A073436
Smallest k such that k mod pi(k) = n.
- Smallest x such that remainder Mod[A065855(x), A000720(x)]=n.A073437
Smallest x such that remainder Mod[A065855(x), A000720(x)]=n.
- Remainder of division G[n]/Pi[n], where G[n] is the number of composites not exceeding n.A073438
Remainder of division G[n]/Pi[n], where G[n] is the number of composites not exceeding n.
- Numbers k such that A073259(k)=4: the length of iteration-transient leading to k-th composite number equals 4.A073439
Numbers k such that A073259(k)=4: the length of iteration-transient leading to k-th composite number equals 4.
- Decimal expansion of csc (Pi degrees) (of course csc (Pi radians) is undefined).A073440
Decimal expansion of csc (Pi degrees) (of course csc (Pi radians) is undefined).
- Decimal expansion of sec (Pi degrees) (of course sec (Pi radians) = -1).A073441
Decimal expansion of sec (Pi degrees) (of course sec (Pi radians) = -1).
- Decimal expansion of cot (Pi degrees) (of course cot (Pi radians) is undefined).A073442
Decimal expansion of cot (Pi degrees) (of course cot (Pi radians) is undefined).
- Numbers k such that k! - k - 1 is prime.A073443
Numbers k such that k! - k - 1 is prime.
- Primes of the form n! - n - 1.A073444
Primes of the form n! - n - 1.
- Second differences of A002808, the sequence of composites.A073445
Second differences of A002808, the sequence of composites.
- Product L(n)*S(n), where L(n) are Lucas numbers and S(n) are Lucas 3-step numbers = A000032(n) * A001644(n).A073446
Product L(n)*S(n), where L(n) are Lucas numbers and S(n) are Lucas 3-step numbers = A000032(n) * A001644(n).
- Decimal expansion of csc(1).A073447
Decimal expansion of csc(1).
- Decimal expansion of sec(1).A073448
Decimal expansion of sec(1).
- Decimal expansion of cot(1).A073449
Decimal expansion of cot(1).
- Triangle T(j,k) = remainder of Fibonacci(j) divided by Fibonacci(k), for 3 < j and 2 < k < j.A073450
Triangle T(j,k) = remainder of Fibonacci(j) divided by Fibonacci(k), for 3 < j and 2 < k < j.
- Number of essentially different ways in which the squares 1,4,9,...,n^2 can be arranged in a sequence such that all pairs of adjacent squares sum to a prime number. Rotations and reversals are counted only once.A073451
Number of essentially different ways in which the squares 1,4,9,...,n^2 can be arranged in a sequence such that all pairs of adjacent squares sum to a prime number. Rotations and reversals are counted only once.
- a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that all pairs of adjacent integers sum to a prime number. Rotations and reversals are counted only once.A073452
a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that all pairs of adjacent integers sum to a prime number. Rotations and reversals are counted only once.
- Number of distinct remainders arising when n is divided by all primes up to n.A073453
Number of distinct remainders arising when n is divided by all primes up to n.
- Number of repeated remainders arising when n is divided by all primes up to n: a(n) = pi(n) - A073453(n).A073454
Number of repeated remainders arising when n is divided by all primes up to n: a(n) = pi(n) - A073453(n).
- Numbers n such that to phi(n) = pi(n)-1.A073455
Numbers n such that to phi(n) = pi(n)-1.
- Numbers n such that phi(n) = pi(n)+1.A073456
Numbers n such that phi(n) = pi(n)+1.
- Numbers k such that phi(k) = pi(k) + 2.A073457
Numbers k such that phi(k) = pi(k) + 2.
- a(n) = floor(prime(n)/composite(n)).A073458
a(n) = floor(prime(n)/composite(n)).
- Smallest x such that Floor[A000040(x)/A002808(x)]=n.A073459
Smallest x such that Floor[A000040(x)/A002808(x)]=n.
- a(n) = smallest solution x to n + pi(x) = phi(x), or 0 if no such solution exists.A073460
a(n) = smallest solution x to n + pi(x) = phi(x), or 0 if no such solution exists.