Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A029854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A029854 gcd(prime(n)+prime(n+1), prime(n+1)+prime(n+2)). +0
2
1, 4, 6, 6, 6, 6, 6, 2, 4, 4, 2, 6, 6, 10, 4, 8, 8, 2, 6, 8, 2, 2, 2, 6, 6, 6, 6, 6, 6, 6, 2, 4, 12, 12, 4, 4, 10, 10, 4, 8, 12, 12, 6, 6, 2, 2, 2, 6, 6, 2, 8, 12, 4, 4, 4, 4, 4, 2, 6, 12, 24, 6, 6, 6, 18, 4, 4, 12, 6, 2, 2, 2, 4, 2, 2, 2, 6, 6, 18, 12, 12, 12, 8 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = gcd(A001043(n), A001043(n+1)).

EXAMPLE

a(20) = gcd(71+73, 73+79) = gcd(144,152) = 8*gcd(18,19) = 8.

CROSSREFS

Sequence in context: A081261 A046262 A147862 this_sequence A141328 A035551 A087573

Adjacent sequences: A029851 A029852 A029853 this_sequence A029855 A029856 A029857

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 14, 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research