Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075451
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075451 a(n)=m is the n-th number such that GCD (A075443(m), A000010(m))=1. +0
2
1, 2, 5, 13, 17, 25, 29, 37, 41, 53, 73, 89, 101, 109, 113, 125, 137, 149, 157, 169, 173, 193, 229, 233, 257, 269, 289, 293, 317, 337, 349, 353, 373, 389, 397, 401, 421, 449, 461, 509, 521, 557, 569, 577, 593, 613, 617, 625, 641, 653, 673 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A075443.

Sequence in context: A139254 A061303 A019362 this_sequence A109515 A135933 A086807

Adjacent sequences: A075448 A075449 A075450 this_sequence A075452 A075453 A075454

KEYWORD

nonn

AUTHOR

Michele Dondi (bik.mido(AT)tiscalinet.it), Sep 18, 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