login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066674 Least number m such that Phi[m]=A000010(m) is divisible by the n-th prime. 6
3, 7, 11, 29, 23, 53, 103, 191, 47, 59, 311, 149, 83, 173, 283, 107, 709, 367, 269, 569, 293, 317, 167, 179, 389, 607, 619, 643, 1091, 227, 509, 263, 823, 557, 1193, 907, 1571, 653, 2339, 347, 359, 1087, 383, 773, 3547, 797, 2111, 2677, 5449, 2749, 467 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Is this a duplicate of A035095? [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008]

For the first 5*10^6 terms, a(n) = A035095(n). - Donovan Johnson, Oct 21 2011

FORMULA

a[n] = Min{m : Mod[Phi[m], p(n)] = 0} = Min{m :Mod[A000010(m), A000040(n)] = 0}

EXAMPLE

All terms seem to be primes of the form a[n]=k*p[n]+1 with various values of k.

CROSSREFS

Cf. A000010, A000040, A066675-A066678.

Cf. A035095.

Sequence in context: A051202 A035095 * A125878 A126112 A194373 A156210

Adjacent sequences:  A066671 A066672 A066673 * A066675 A066676 A066677

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 19 2001

EXTENSIONS

a(2) corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 18:54 EST 2012. Contains 205939 sequences.