The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A211389 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A211389

a(n) is the first occurrence of n in sequence A209266.
(history; published version)

#13 by T. D. Noe at Mon Feb 18 13:25:42 EST 2013

STATUS

proposed

approved

#12 by T. D. Noe at Sun Feb 17 19:13:29 EST 2013

STATUS

editing

proposed

Discussion

Mon Feb 18

12:06

Lei Zhou: Editing on A209266 has been committed as suggested.  Please review.  Thanks.

#11 by T. D. Noe at Sun Feb 17 19:12:15 EST 2013

NAME

a(n) is the first occurance occurrence of n in sequence A209266.

EXAMPLE

A209266 = {0, 0, 1, 1, 2, 2, 2, 1, 3, 3, 1, 3, 3, 4, 3, 5, 4, 2, 5, 4, 4, 4, 4, 3, 3, 6, 6, 4,...} starting from A209266(3)=1.

MATHEMATICA

aim = 32; a = Table[0, {i, 1, aim}]; zeros = aim; i = 2; While[i++; p = Prime[i]; ct = 0; Do[If[(PrimeQ[p - j]) && (PrimeQ[p + j]), f = Last[FactorInteger[j]][[1]]; If[f <= 5, ct++]], {j, 2, p, 2}]; If[(ct <= aim) && (a[[ct]] == 0), a[[ct]] = i; zeros--; zeros > 0]; a

p = Prime[i]; ct = 0; Do[If[(PrimeQ[p - j]) && (PrimeQ[p + j]),

f = Last[FactorInteger[j]][[1]]; If[f <= 5, ct++]], {j, 2, p, 2}];

If[(ct <= aim) && (a[[ct]] == 0), a[[ct]] = i; zeros--; zeros > 0]; a

CROSSREFS

Cf. A209266.

STATUS

proposed

editing

Discussion

Sun Feb 17

19:13

T. D. Noe: Please add two zeros to A209266 and change the b-file.

#10 by Lei Zhou at Fri Feb 15 11:34:01 EST 2013

STATUS

editing

proposed

#9 by Lei Zhou at Mon Feb 11 10:55:22 EST 2013

DATA

3, 5, 9, 14, 16, 26, 54, 67, 74, 103, 161, 293, 236, 432, 249, 788, 1078, 796, 1885, 2091, 1712, 2618, 4099, 7088, 8137, 8091, 16086, 12595, 27627, 22835, 44576, 31305, 68888, 109617, 86463, 77206, 126383, 202035

#8 by Lei Zhou at Fri Feb 08 16:56:04 EST 2013

DATA

#7 by Lei Zhou at Fri Feb 08 12:21:17 EST 2013

DATA

3, 5, 9, 14, 16, 26, 54, 67, 74, 103, 161, 293, 236, 432, 249, 788, 1078, 796, 1885, 2091, 1712, 2618, 4099, 7088, 8137, 8091, 16086, 12595, 27627, 22835, 44576, 31305, 68888, 109617, 86463, 77206

#6 by Lei Zhou at Fri Feb 08 10:29:59 EST 2013

DATA

3, 5, 9, 14, 16, 26, 54, 67, 74, 103, 161, 293, 236, 432, 249, 788, 1078, 796, 1885, 2091, 1712, 2618, 4099, 7088, 8137, 8091, 16086, 12595, 27627, 22835, 44576, 31305, 68888

MATHEMATICA

p = Prime[i]; ct = 0; Do[If[(PrimeQ[p - j]) && (PrimeQ[p + j]),

If[(ct <= aim) && (a[[ct]] == 0), a[[ct]] = i; zeros--; zeros > 0]; a

#5 by Lei Zhou at Thu Feb 07 18:58:15 EST 2013

NAME

allocated for Lei Zhoua(n)is the first occurance of n in sequence A209266

DATA

3, 5, 9, 14, 16, 26, 54, 67, 74, 103, 161, 293, 236, 432, 249, 788, 1078, 796, 1885, 2091, 1712, 2618, 4099, 7088, 8137, 8091, 16086, 12595, 27627, 22835, 44576, 31305

OFFSET

1,1

EXAMPLE

A209266={1, 1, 2, 2, 2, 1, 3, 3, 1, 3, 3, 4, 3, 5, 4, 2, 5, 4, 4, 4, 4, 3, 3, 6, 6, 4,...} starting from A209266(3)=1.

Number 1 first appears as A209266(3), number 2 as A209266(5), number 3 as A209266(9)...

So, a = {3, 5, 9, ...} starting from a(1)=3.

MATHEMATICA

aim = 32; a = Table[0, {i, 1, aim}]; zeros = aim; i = 2; While[i++;

p = Prime[i]; ct = 0; Do[If[(PrimeQ[p - j]) && (PrimeQ[p + j]),

f = Last[FactorInteger[j]][[1]]; If[f <= 5, ct++]], {j, 2, p, 2}];

If[(ct <= aim) && (a[[ct]] == 0), a[[ct]] = i; zeros--; zeros > 0]; a

CROSSREFS

Cf. A209266

KEYWORD

allocated

nonn,hard

AUTHOR

Lei Zhou, Feb 07 2013

STATUS

approved

editing

#4 by Lei Zhou at Thu Feb 07 18:58:15 EST 2013

NAME

allocated for Lei Zhou

KEYWORD

recycled

allocated