A053318 -id:A053318 - cp's OEIS frontend

A052381 The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).

3, 7, 47, 389, 409, 199, 24749, 3373, 20183, 46703, 19867, 16763, 142811, 14563, 69593, 763271, 276637, 255767, 363989, 383179, 247099, 2130809, 15370423, 3565931, 458069, 9401647, 6314393, 20823437, 9182389, 4911251, 15442121

Offset: 1

Labos Elemer, Mar 13 2000

nonn

A prime quadruple (triple), {[p,p+d],[p+D,p+D+d]} is called a "non-overlapping" (disjoint or touching) pair of twins if D = distance >= d = difference "inside" twin.

			If n=23, d=46, min{D}=48 then the first suitable quadruple of primes is [15370423, 15370469, 15370471, 15370517] with difference pattern [46, 2, 46]; if n=3, d=6, min{D}=6 then the first such triple is [47, 53, 53, 59] = [47, 53, 59] with difference pattern [6, 6].

The first 10 terms here appear as initial terms in A052350-A052359.

Smallest p so that [p, p+2n], [p+min{D}, p+2n+min{D}] is a quadruple (or triple if d=min{D}) of consecutive primes.

Corrected by Jud McCranie, Jan 04 2001

a(11) corrected by Sean A. Irvine, Nov 07 2021

A241882 Numbers with d digits that are divisible by 2^d and have at most 2 distinct digits: exactly one even digit and at most one odd digit.

Original entry on oeis.org

2, 4, 6, 8, 12, 16, 32, 36, 44, 52, 56, 72, 76, 88, 92, 96, 112, 144, 232, 272, 336, 344, 544, 552, 616, 656, 696, 744, 776, 888, 944, 992, 1616, 1888, 2112, 2272, 2992, 3232, 3344, 3888, 4144, 4544, 4944, 5552, 5888, 6336, 6656, 7744, 7776, 7888, 9696, 9888

Offset: 1

J. Lowell, Apr 30 2014

Union of 20 different sequences, all of which are defined as "a(n) contains n digits (either [any odd digit] or [any nonzero even digit] and is divisible by 2^n)."

Subsequence of A050622. - Michel Marcus, May 07 2014

			24 is not in the sequence because it has distinct even digits.

Ray Chandler, Table of n, a(n) for n = 1..10000

Cf. A035014, A053312-A053318, A053332-A053338, A053376-A053380 (sequences whose union is this sequence).

isok(n) = {digs = digits(n); d = #digs; if (n % 2^d, return (0)); sd = Set(digs); if (#sd > 2, return (0)); if (#sd < 2, return (1)); ((sd[1] % 2) + (sd[2] % 2)) == 1;} \\ Michel Marcus, May 02 2014

More terms from Michel Marcus, May 02 2014

cp's OEIS Frontend

A052381 The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions