OFFSET
1,2
COMMENTS
n is in this sequence if and only if sum_{k=1..n} (n-k|k) = sum_{k=1..n} |(n-k|k)|.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..500
MATHEMATICA
Reap[ Do[ If[ Sum[ KroneckerSymbol[n - k, k], {k, 1, n}] == EulerPhi[n], Print[n]; Sow[n]], {n, 1, 8000}]][[2, 1]] (* Jean-François Alcover, Jul 29 2013 *)
PROG
(Sage)
def A215200_row(n): return [kronecker_symbol(n-k, k) for k in (1..n)]
[n for n in (1..1000) if sum(A215200_row(n)) == euler_phi(n)]
(PARI) is(m) = sum(k = 1, m, kronecker(m-k, k)) == eulerphi(m); \\ Amiram Eldar, Nov 08 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Aug 07 2012
STATUS
approved