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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066675 A066674[n]-1 divided by the n-th prime. 3
1, 2, 2, 4, 2, 4, 6, 10, 2, 2, 10, 4, 2, 4, 6, 2, 12, 6, 4, 8, 4, 4, 2, 2, 4, 6, 6, 6, 10, 2, 4, 2, 6, 4, 8, 6, 10, 4, 14, 2, 2, 6, 2, 4, 18, 4, 10, 12, 24, 12, 2, 2, 6, 2, 6, 6, 8, 6, 4, 2, 6, 2, 4, 6, 6, 26, 6, 10, 6, 10, 14, 2, 6, 4, 12, 12, 24, 6, 8, 4, 2, 10, 2, 4, 10, 2, 8, 30, 6, 12, 6, 8, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Is this a duplicate of A035096? [From R. J. Mathar, Dec 15 2008]

LINKS

Table of n, a(n) for n=1..93.

FORMULA

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

CROSSREFS

Cf. A000010, A000040, A066675-A066678.

Sequence in context: A170905 A233761 A035096 * A219433 A274879 A222043

Adjacent sequences:  A066672 A066673 A066674 * A066676 A066677 A066678

KEYWORD

nonn

AUTHOR

Labos Elemer, Dec 19 2001

EXTENSIONS

Corrected a(2). R. J. Mathar, Dec 15 2008

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 17 19:35 EST 2017. Contains 294834 sequences.