|
| |
|
|
A063500
|
|
a(n) is the least composite solution of Phi[x+6n]=Phi[x]+6n.
|
|
3
| |
|
|
21, 45, 63, 95, 224, 135, 301, 95, 189, 161, 260, 115, 400, 165, 476, 195, 620, 145, 644, 203, 640, 285, 343, 155, 728, 185, 567, 155, 560, 301, 860, 185, 1000, 329, 1892, 235
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Matthew M. Conroy, Home page (listed instead of email address)
|
|
|
FORMULA
| Smallest values satisfying A000010[a(n)+6n]=A000010[a(n)]+6n relation.
|
|
|
EXAMPLE
| n=100, d=600=6n, a(100)=671=11.61, Phi[671]=600, Phi[671+600]=Phi[1271]=(31-1).(41-1)=600+600=Phi[671]+d.
|
|
|
PROG
| (PARI) { for (n=1, 36, a=1; while (isprime(a) || eulerphi(a + 6*n) != eulerphi(a) + 6*n, a++); write("b063500.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 24 2009]
|
|
|
CROSSREFS
| A000010, A054904, A054905.
Sequence in context: A168519 A003857 A099468 * A102603 A147222 A199767
Adjacent sequences: A063497 A063498 A063499 * A063501 A063502 A063503
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Jul 30 2001
|
|
|
EXTENSIONS
| Next term (a(37)) exceeds 10^5 - Matthew M. Conroy, Sep 13 2001
Next term (a(37)), if it exists, exceeds 10^7. - David Wasserman (wasserma(AT)spawar.navy.mil), Jul 03 2002
|
| |
|
|
