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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160597 Denominator of coresilience C(n) = (n-eulerphi(n))/(n-1). 1
1, 2, 3, 4, 5, 6, 7, 8, 3, 10, 11, 12, 13, 2, 15, 16, 17, 18, 19, 20, 7, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 11, 34, 35, 36, 37, 38, 13, 40, 41, 42, 43, 44, 15, 46, 47, 48, 49, 50, 51, 52, 53, 18, 55, 8, 19, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 3, 70, 71, 72, 73, 74 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

COMMENTS

Obviously C(p)=1/(p-1) for all primes p.

LINKS

Project Euler, Problem 245: resilient fractions, May 2009

EXAMPLE

a(10)=3 since for n=10, we have (n-eulerphi(n))/(n-1) = (10-4)/9 = 2/3.

PROG

(PARI) A160497(n)=denominator((n-eulerphi(n))/(n-1))

CROSSREFS

Sequence in context: A104418 A173528 A043268 * A097377 A063917 A171890

Adjacent sequences:  A160594 A160595 A160596 * A160598 A160599 A160600

KEYWORD

nonn

AUTHOR

M. F. Hasler (www.univ-ag.fr/~mhasler), May 23 2009

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 15 05:45 EST 2012. Contains 205694 sequences.