User:Magnus Manske/Mix'n'match report/1503

From Wikidata
Jump to navigation Jump to search

A report for the Mix'n'match tool. This page will be replaced regularly! Please note:

  • If you fix something from this list on Wikidata, please fix it on Mix'n'match as well, if applicable. Otherwise, the error might be re-introduced from there.
  • 'External ID' refers to the IDs in the original (external) catalog; the same as the statement value for the associated property.

OEIS[edit]

identifer on the On-Line Encyclopedia of Integer Sequences

Unknown external ID[edit]

External ID Item
A344856 Jellyfish Hearts sequence (Q107209392)

Different items for the same external ID[edit]

External ID External label Item in Wikidata Item in Mix'n'Match Mix'n'match entry
A000027 The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous positive integer (Q28920044) 21199}} 56242829
A000041 a(n) = number of partitions of n (the partition numbers). partition (Q1082910) 15846551}} 56242843
A000330 Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6. square pyramidal number (Q18949) 1398443}} 56243132
A000668 Mersenne primes (of form 2^p - 1 where p is a prime). Mersenne prime (Q186875) 10338607}} 56243470
A001221 Number of distinct primes dividing n (also called omega(n)). number of distinct prime divisors (Q104120330) 104120010}} 56244023
A001477 The nonnegative integers. non-negative integer (Q28920052) 21199}} 56244279
A005117 Squarefree numbers: numbers that are not divisible by a square greater than 1. square-free integer (Q50706) 2509291}} 56247921
A080075 Proth numbers: of the form k*2^m + 1 for k odd, m >= 1 and 2^m > k. Proth prime (Q77717996) 593418}} 56322974
A080076 Proth primes: primes of the form k*2^m + 1 with odd k < 2^m, m >= 1. Proth number (Q593418) 3771212}} 56322975

Same item for multiple external IDs in Mix'n'match[edit]

Item in Mix'n'Match Mix'n'match entry External ID External label
natural number (Q21199) 56242829 A000027 The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous
56244279 A001477 The nonnegative integers.
Cullen number (Q532389) 56248653 A005849 Prime Cullen numbers: numbers n such that n*2^n + 1 is prime.
56483223 A240234 Least number k such that k*n^k + 1 is prime, or 0 if no such number exists.
Apéry's constant (Q622682) 56244919 A002117 Decimal expansion of zeta(3) = Sum_{m>=1} 1/m^3.
56256442 A013631 Continued fraction for zeta(3).
Feigenbaum constants (Q673184) 56249694 A006890 Decimal expansion of Feigenbaum bifurcation velocity.
56249695 A006891 Decimal expansion of Feigenbaum reduction parameter.
Bernoulli number (Q694114) 56270461 A027641 Numerator of Bernoulli number B_n.
56270462 A027642 Denominator of Bernoulli number B_n.
betrothed numbers (Q846701) 56246305 A003502 The smaller of a betrothed pair.
56246306 A003503 The larger of a betrothed pair.
sexy prime (Q1194842) 56266017 A023201 Sexy primes: numbers n such that n and n + 6 are both prime.
56288962 A046117 Primes p such that p-6 is also prime.
square triangular number (Q1885380) 56243902 A001100 Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <
56243912 A001110 Square triangular numbers: numbers that are both triangular and square.
reciprocal Fibonacci constant (Q3772671) 56322483 A079586 Decimal expansion of Sum_{k>=1} 1/F(k) where F(k) is the k-th Fibonacci number A000045 (k).
56322484 A079587 Continued fraction expansion of sum(k>=1,1/F(k)) where F(k) is the k-th Fibonacci number A000045 (k).
Mersenne number (Q10338607) 56243027 A000225 a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348 .)
56243470 A000668 Mersenne primes (of form 2^p - 1 where p is a prime).
Abacaba pattern (Q48969138) 56244313 A001511 The ruler function: 2^a(n) divides 2n. Or, a(n) = 2-adic valuation of 2n.
56250618 A007814 Exponent of highest power of 2 dividing n, a.k.a. the binary carry sequence, the ruler sequence, or the 2-adic valuation of n.

Multiple items for the same external ID in Wikidata[edit]

External ID Items in Mix'n'Match
A000041 partition (Q1082910)
partition function (Q15846551)
A000330 square pyramidal number (Q18949)
Faulhaber's formula (Q1398443)
A001221 number of distinct prime divisors (Q104120010)
number of distinct prime divisors (Q104120330)
A080076 Proth number (Q593418)
Proth's theorem (Q3771212)