|
Search: id:A081228
|
|
| |
|
| 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 8, 9, 10, 11, 12, 12, 12, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 17, 18, 19, 19, 19, 19, 19, 19, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 23, 24, 25, 25, 25, 26, 26, 27
(list; graph; listen)
|
|
|
OFFSET
|
1,11
|
|
|
EXAMPLE
|
a(25)=6 since A081227[1..25] has 6 ones and 19 zeros.
|
|
MAPLE
|
digcomp := proc(A, B) local a, b, crit, f; description "returns the digits that 'A' and 'B' have in common; if a third argument is given and it is 'sum' then the sum of the common digits is returned, else if it is 'num' then the number of common digits is returned."; if nargs>2 then crit := args[3] else crit := NULL fi; a := convert(`if`(A=0, [0], (convert(A, base, 10))), set); b := convert(`if`(B=0, [0], (convert(B, base, 10))), set); f := a intersect b; if crit=sum then return `if`(nops(f)>0, `+`(op(f)), -1) elif crit=num then return nops(f) else return f; fi; end proc; ListTools[PartialSums]([seq(digcomp(i, ithprime(i), num), i=1..200)]);
|
|
CROSSREFS
|
Cf. A081227, A081229.
Sequence in context: A029134 A029130 A081611 this_sequence A003002 A087180 A029121
Adjacent sequences: A081225 A081226 A081227 this_sequence A081229 A081230 A081231
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Francois Jooste (pin(AT)myway.com), Mar 11 2003
|
|
|
Search completed in 0.002 seconds
|
