OFFSET
1,1
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 33, pp. 12, Ellipses, Paris 2008.
R. K. Guy, Unsolved Problems in Number Theory, B18.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
MATHEMATICA
Select[Range[2500], DivisorSigma[0, #]==DivisorSigma[0, #+1] == DivisorSigma[ 0, #+2]&] (* Harvey P. Dale, Nov 12 2012 *)
Flatten[Position[Partition[DivisorSigma[0, Range[2500]], 3, 1], {x_, x_, x_}]] (* Harvey P. Dale, Jul 06 2015 *)
SequencePosition[DivisorSigma[0, Range[2500]], {x_, x_, x_}][[All, 1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 03 2017 *)
PROG
(Haskell)
import Data.List (elemIndices)
a005238 n = a005238_list !! (n-1)
a005238_list = map (+ 1) $ elemIndices 0 $ zipWith (+) ds $ tail ds where
ds = map abs $ zipWith (-) (tail a000005_list) a000005_list
-- Reinhard Zumkeller, Oct 03 2012
(PARI) is(n)=my(d=numdiv(n)); numdiv(n+1)==d && numdiv(n+2)==d \\ Charles R Greathouse IV, Feb 06 2017
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
EXTENSIONS
More terms from Olivier Gérard
STATUS
approved