OFFSET
1,2
COMMENTS
An easy way to prove that this sequence is infinite is to observe that it contains all numbers of the form 10^k+1. - Stefan Steinerberger, Mar 31 2006
For n>0: digital root (A010888) of 2n or n^2 is either 4 or 9. - Reinhard Zumkeller, Oct 01 2007
REFERENCES
Problem 117 in Loren Larson's translation of Paul Vaderlind's book.
LINKS
Reinhard Zumkeller and Harvey P. Dale, Table of n, a(n) for n = 1..1000 (first 101 terms from Zumkeller)
FORMULA
MATHEMATICA
Select[Range[0, 1000], Sum[DigitCount[2# ][[i]]*i, {i, 1, 9}] == Sum[DigitCount[ #^2][[i]]*i, {i, 1, 9}] &] (* Stefan Steinerberger, Mar 31 2006 *)
Select[Range[0, 1000], Total[IntegerDigits[2#]]==Total[ IntegerDigits[ #^2]]&] (* Harvey P. Dale, Sep 25 2012 *)
PROG
(Haskell)
import Data.List (elemIndices)
import Data.Function (on)
a049343 n = a049343_list !! (n-1)
a049343_list = elemIndices 0
$ zipWith ((-) `on` a007953) a005843_list a000290_list
-- Reinhard Zumkeller, Apr 03 2011
(Magma) [n: n in [0..1000] | &+Intseq(2*n) eq &+Intseq(n^2)]; // Vincenzo Librandi, Nov 17 2015
CROSSREFS
KEYWORD
AUTHOR
STATUS
approved