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!)
 A109072 Number of decimal digits ( counted with multiplicity ) in n but not in n^2. 2
 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 0, 1, 0, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 0, 1, 1, 2, 2, 0, 1, 2, 2, 2, 0, 1, 2, 0, 0, 1, 0, 2, 1, 1, 1, 1, 2, 1, 0, 1, 0, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,18 LINKS Robert Israel, Table of n, a(n) for n = 0..10000 MAPLE f:= proc(n) local L2; L2:= convert(n^2, base, 10); nops(remove(t -> member(t, L2), convert(n, base, 10))); end proc: map(f, [\$0..200]); # Robert Israel, Feb 22 2017 MATHEMATICA UnsortedComplement[x_List, y__List]:=Replace[x, Dispatch[(#\[RuleDelayed]Sequence[])&/@Union[y]], 1]; Table[Length[UnsortedComplement[IntegerDigits[n], IntegerDigits[n^2]]], {n, 0, 200}] CROSSREFS Cf. A076493 (number of common and distinct decimal digits of n and n^2). Cf. A109071 (number of common decimal digits (counted with multiplicity) of n and n^2). Sequence in context: A239702 A202084 A337763 * A100727 A064892 A236344 Adjacent sequences:  A109069 A109070 A109071 * A109073 A109074 A109075 KEYWORD base,easy,nonn AUTHOR Zak Seidov, Jun 20 2005 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 25 13:01 EDT 2020. Contains 337344 sequences. (Running on oeis4.)