# duplicates

Christian G.Bower bowerc at usa.net
Mon Jun 13 06:09:41 CEST 2005

```I don't know if Mitch mentioned on this list that in addition to
a page of possibly multiplicative sequences, he has a list of
possibly duplicate sequences.

I'm looking at one that someone on the list might help with

1,0,1,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,1
A039966 An example of a d-perfect sequence.
A104405 Number of partitions of n into distinct powers of 3.
??

ID Number: A104405
URL:       http://www.research.att.com/projects/OEIS?Anum=A104405
Sequence:  1,0,1,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,
1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,1,0,0,0,0,1,
1,0,1,1,0,0,0,0,0,0,0,0,0,0,0
Name:      Number of partitions of n into distinct powers of 3.

can be described as characteristic function of numbers with no "2"
in their ternary representation

ID Number: A039966
URL:       http://www.research.att.com/projects/OEIS?Anum=A039966
Sequence:  1,0,1,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,
1
Name:      An example of a d-perfect sequence.

can be described as A005043(n-1) mod 3

ID Number: A005043 (Formerly M2587)
URL:       http://www.research.att.com/projects/OEIS?Anum=A005043
Sequence:  1,0,1,1,3,6,15,36,91,232,603,1585,4213,11298,30537,83097,
227475,625992,1730787,4805595,13393689,37458330,105089229,
295673994,834086421,2358641376,6684761125,18985057351,
54022715451,154000562758
Name:      Motzkin sums: a(n) = (n-1)*(2*a(n-1)+3*a(n-2))/(n+1). Also called
Riordan numbers or ring numbers.

I've verified the 2 sequences match for the first 512 terms.

Christian

```