Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067006
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067006 Smallest number for which the totient is divisible by the n-th non-totient number, i.e. n-th term of A007617. +0
1
7, 11, 29, 19, 23, 53, 29, 31, 103, 191, 43, 47, 101, 53, 81, 59, 311, 67, 103, 71, 149, 191, 79, 83, 173, 181, 283, 197, 101, 103, 107, 121, 229, 709, 367, 311, 127, 131, 269, 137, 139, 569, 293, 149, 151, 229, 463, 317, 163, 167, 1021, 173, 349, 179, 181, 547 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=Min{x : Mod[x, A007617(n)]=0}. For all non-totient numbers x, qx+1 is prime with large enough q and a divisor of Phi[qx+1]=qx is x, the selected non-totient number.

EXAMPLE

14=A007617(7) is not totient of any other number, but Phi[29]=28 is divisible with 14 and 29 is the smallest number of which the totient is a multiple of 14, so a(7)=29.

CROSSREFS

Cf. A000010, A007617, A066674-A066678, A067005.

Sequence in context: A002810 A045736 A158807 this_sequence A136020 A076304 A122560

Adjacent sequences: A067003 A067004 A067005 this_sequence A067007 A067008 A067009

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 22 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research