|
| |
|
|
A161962
|
|
Odd numbers n such that phi(n)<phi(n+1).
|
|
2
| |
|
|
105, 165, 315, 525, 585, 735, 1155, 1365, 1485, 1575, 1755, 1785, 1815, 1995, 2145, 2205, 2415, 2475, 2535, 2805, 2835, 3003, 3045, 3315, 3465, 3675, 3885, 3927, 4095, 4125, 4305, 4455, 4485, 4515, 4725, 4785, 4845, 4935, 5115, 5145
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| If n is even then for obvious reasons phi(n) will usually be less than phi(n+1). So it is more interesting to see when this occurs for odd n.
|
|
|
EXAMPLE
| 105 is in this list since phi(105)=48 and phi(106)=52.
|
|
|
MAPLE
| with(numtheory): a := proc (n) if `mod`(n, 2) = 1 and phi(n) < phi(n+1) then n else end if end proc: seq(a(n), n = 1 .. 6000); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 11 2009]
|
|
|
CROSSREFS
| Sequence in context: A046405 A128278 A128284 * A046887 A026066 A167629
Adjacent sequences: A161959 A161960 A161961 * A161963 A161964 A161965
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| David Angell (angell(AT)maths.unsw.edu.au), Jun 22 2009
|
| |
|
|
