|
Search: id:A038556
|
|
|
| A038556 |
|
Periodic derivative of n. |
|
+0
4
|
|
| 0, 0, 3, 0, 5, 6, 3, 0, 9, 10, 15, 12, 5, 6, 3, 0, 17, 18, 23, 20, 29, 30, 27, 24, 9, 10, 15, 12, 5, 6, 3, 0, 33, 34, 39, 36, 45, 46, 43, 40, 57, 58, 63, 60, 53, 54, 51, 48, 17, 18, 23, 20, 29, 30, 27, 24, 9, 10, 15, 12, 5, 6, 3, 0, 65, 66, 71, 68, 77, 78, 75, 72, 89, 90, 95, 92, 85
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Every term is an evil number (A001969) and every evil number occurs an infinite number of times in this sequence. Observe self-similarity in the graph of the sequence. - T. D. Noe, Jun 22 2007
|
|
REFERENCES
|
Simmons, G. J. The structure of the differentiation digraphs of binary sequences. Ars Combin. 35 (1993), A, 71-88. Math. Rev. 95f:05052.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..4096
|
|
FORMULA
|
If n=b_k b_{k-1} ... b_0 in base 2, a(n) is number with binary expansion (b_k+b_{k-1}) (b_{k-1}+b_{k-2}) ... (b_1+b_0) (b_0+b_{k}). Also n XOR (n rotate 1).
|
|
EXAMPLE
|
11=1011->1100 so a(11)=12.
|
|
CROSSREFS
|
Cf. A038554, A038557.
Sequence in context: A021770 A004589 A102391 this_sequence A052483 A019915 A052123
Adjacent sequences: A038553 A038554 A038555 this_sequence A038557 A038558 A038559
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Apr 08 2001
|
|
|
Search completed in 0.002 seconds
|
