login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122462 a(n) = gcd(b(n-1),b(n)), where b(i) = A122280(i). 0
2, 2, 3, 3, 3, 2, 5, 5, 3, 2, 2, 7, 7, 3, 2, 11, 11, 3, 3, 2, 2, 13, 13, 3, 2, 17, 17, 3, 2, 5, 5, 7, 2, 19, 19, 3, 5, 2, 23, 23, 3, 2, 2, 2, 2, 11, 5, 2, 29, 29, 3, 7, 7, 2, 31, 31, 3, 2, 13, 5, 2, 2, 37, 37, 3, 3, 3, 2, 2, 41, 41, 3, 3, 7, 11, 2, 43, 43, 3, 2, 2, 47, 47, 3, 2, 2, 5, 5, 5, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

COMMENTS

Primes arising in A122280 as greatest common divisor.

PROG

(PARI) {m=100; z=2*m; w=vectorsmall(z); b=1; a=2; w[b]=1; w[a]=1; stop=0; n=3; while(!stop&&n<=m, j=1; while(j<=z&&(w[j]==1||!isprime(p=gcd(a, j))), j++); if(j>z, stop=1, print1(p, ", "); a=j; w[a]=1; n++))}

CROSSREFS

Cf. A122280.

Sequence in context: A014499 A055778 A106482 * A115230 A165024 A157639

Adjacent sequences:  A122459 A122460 A122461 * A122463 A122464 A122465

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 09 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 13:12 EST 2012. Contains 205909 sequences.