Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098228
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098228 a[n]=Floor[n/(n-EulerPhi[n])=Floor[n/cototient(n)] +0
1
2, 3, 2, 5, 1, 7, 2, 3, 1, 11, 1, 13, 1, 2, 2, 17, 1, 19, 1, 2, 1, 23, 1, 5, 1, 3, 1, 29, 1, 31, 2, 2, 1, 3, 1, 37, 1, 2, 1, 41, 1, 43, 1, 2, 1, 47, 1, 7, 1, 2, 1, 53, 1, 3, 1, 2, 1, 59, 1, 61, 1, 2, 2, 3, 1, 67, 1, 2, 1, 71, 1, 73, 1, 2, 1, 4, 1, 79, 1, 3, 1, 83, 1, 4, 1, 2, 1, 89, 1, 4, 1, 2, 1, 4, 1, 97 (list; graph; listen)
OFFSET

2,1

EXAMPLE

If n=p^j where p is a prime number, then cototient[p^j]=p^j-p^j(p-1/p)=p^(j-1) so n/cototient[n]=p hold s for all prime-powers.

MATHEMATICA

Table[Floor[n/(n-EulerPhi[n])], {n, 2, 1000}]

CROSSREFS

Sequence in context: A099636 A099635 A086847 this_sequence A081303 A127705 A053139

Adjacent sequences: A098225 A098226 A098227 this_sequence A098229 A098230 A098231

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 25 2004

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research