Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066675
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066675 A066674[n]-1 divided by the n-th prime. +0
2
1, 4, 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; listen)
OFFSET

1,2

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: A105256 A064127 A105397 this_sequence A010474 A064887 A114424

Adjacent sequences: A066672 A066673 A066674 this_sequence A066676 A066677 A066678

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 19 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research