OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000 (terms 1..100 from Reinhard Zumkeller)
László Tóth, A survey of the alternating sum-of-divisors function, arXiv:1111.4842 [math.NT], 2011-2014.
FORMULA
A206475(a(n)) = 0. - Reinhard Zumkeller, Feb 08 2012
MATHEMATICA
(* b = A206369 *) b[n_] := n*DivisorSum[n, LiouvilleLambda[#]/# &];
Reap[For[n = 1, n <= 120000, n++, If[b[n] == b[n+1], Print[n]; Sow[n] ] ] ][[2, 1]] (* Jean-François Alcover, Dec 04 2017 *)
PROG
(Haskell)
import Data.List (elemIndices)
a206368 n = a206368_list !! (n-1)
a206368_list = map (+ 1) $ elemIndices 0 a206475_list
-- Reinhard Zumkeller, Feb 08 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 06 2012
STATUS
approved