Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063091 Primes p such that GCD[ 1+p(n+1), 1+p(n) ] = GCD[ -1+p(n+1), -1+p(n) ]. +0
3
2, 3, 5, 11, 17, 29, 41, 59, 71, 101, 107, 137, 149, 179, 191, 197, 227, 239, 269, 281, 283, 311, 317, 337, 347, 419, 431, 461, 521, 547, 569, 577, 599, 617, 641, 659, 773, 787, 809, 821, 827, 857, 863, 881, 1019, 1031, 1049, 1061, 1091, 1129, 1151, 1153 (list; graph; listen)
OFFSET

1,1

EXAMPLE

p=101 is here because GCD[102,104]=2=GCD[100,102];

CROSSREFS

A058263.

Sequence in context: A094480 A038909 A073534 this_sequence A124588 A059428 A084571

Adjacent sequences: A063088 A063089 A063090 this_sequence A063092 A063093 A063094

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 06 2001

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 December 4 14:15 EST 2008. Contains 151279 sequences.


AT&T Labs Research