The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069816 a(n) = (sum of digits of n)^2 - (sum of digits^2 of n). 4
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 0, 6, 12, 18, 24, 30, 36, 42, 48, 54, 0, 8, 16, 24, 32, 40, 48, 56, 64, 72, 0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 0, 12, 24, 36, 48, 60, 72, 84, 96, 108, 0, 14, 28, 42, 56, 70, 84 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,12 COMMENTS a(n) = 0 iff n is a single-digit number or is a power of ten times a single-digit number. - Robert G. Wilson v, May 04 2002 LINKS FORMULA From R. J. Mathar, Jun 23 2009: (Start) a(n) = 2*A035930(n), n <= 100. a(n) = A118881(n) - A003132(n). (End) EXAMPLE n=14: sum of digits = 5, squaring gives 25; sum of squared digits of n = 1^2 + 4^2 = 17, so a(14) = 25 - 17 = 8. MAPLE A007953 := proc(n) add(d, d=convert(n, base, 10)) ; end proc: A003132:= proc(n) add(d^2, d=convert(n, base, 10)) ; end proc: A118881 := proc(n) (A007953(n))^2 ; end proc: A069816 := proc(n) A118881(n)-A003132(n) ; end proc: seq(A069816(n), n=0..80) ; # R. J. Mathar, Jun 23 2009 MATHEMATICA f[n_] := Plus @@ IntegerDigits[n]^2 - Plus @@ (IntegerDigits[n]^2); Table[ f[n], {n, 0, 100}] CROSSREFS Cf. A067552. Sequence in context: A055958 A241142 A271907 * A088116 A100817 A074157 Adjacent sequences:  A069813 A069814 A069815 * A069817 A069818 A069819 KEYWORD nonn,base,easy AUTHOR N. J. A. Sloane, May 03 2002 EXTENSIONS Extended by Robert G. Wilson v, May 04 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 04:22 EDT 2021. Contains 347508 sequences. (Running on oeis4.)