Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084311 a(n)=GCD[p(n)-1,n-1]. +0
2
1, 1, 2, 3, 2, 1, 2, 1, 2, 1, 10, 1, 4, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 24, 25, 2, 1, 4, 1, 6, 1, 8, 3, 2, 5, 12, 1, 2, 1, 2, 1, 2, 1, 4, 9, 2, 1, 2, 1, 2, 17, 4, 1, 2, 1, 4, 3, 2, 1, 6, 1, 2, 1, 8, 1, 66, 1, 2, 3, 2, 1, 6, 1, 2, 1, 4, 11, 2, 1, 2, 3, 2, 1, 6, 17, 2, 3, 4, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 9, 2, 1 (list; graph; listen)
OFFSET

1,3

MATHEMATICA

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

CROSSREFS

Cf. A084309-A084316.

Sequence in context: A082868 A126626 A137927 this_sequence A026490 A053555 A124160

Adjacent sequences: A084308 A084309 A084310 this_sequence A084312 A084313 A084314

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

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research