Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084310
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084310 a(n)=GCD[p(n)+1,n]. +0
3
1, 2, 3, 4, 1, 2, 1, 4, 3, 10, 1, 2, 1, 2, 3, 2, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 4, 1, 6, 1, 4, 3, 2, 5, 4, 1, 2, 3, 2, 1, 14, 1, 2, 9, 2, 1, 16, 1, 10, 3, 4, 1, 18, 1, 8, 3, 2, 1, 6, 1, 2, 7, 8, 1, 6, 1, 2, 3, 70, 1, 72, 1, 2, 5, 4, 1, 2, 1, 10, 3, 2, 1, 14, 5, 2, 3, 2, 1, 2, 13, 4, 1, 2, 5, 24, 1, 2, 1, 2 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

Table[GCD[Prime[w]+1, w], {w, 1, 128}]

CROSSREFS

Cf. A084309-A084316.

Sequence in context: A104412 A118310 A073057 this_sequence A078978 A171171 A159957

Adjacent sequences: A084307 A084308 A084309 this_sequence A084311 A084312 A084313

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 13 2003

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 01:26 EDT 2010. Contains 173632 sequences.


AT&T Labs Research