Base change notation

[Antti Karttunen]

Marc LeBrun wrote:

>
>
> 4. Object-oriented ("numbral") arithmetic
>
> More radically, the indexing interpretation doesn't constrain b to be 
> a numerical "base" at all--it can be a more general "basis" whose 
> elements follow some different algebra, such as GF2.  This allows us 
> to encode its elements as GF2[n]2 so as to be able to refer to them in 
> OEIS sequences, and to write identities such as
>
>   (GF2[n]^2)2  =  Z2[n]4  (*)
>
> where the types of the subexpressions are clear as is their 
> applicative evaluation (a la lambda calculus)...
>
How do you express the sequence
http://www.research.att.com/~njas/sequences/A060112
in your notation, involving rewriting Zeckendorf expansion (i.e. the 
Fibonacci number system)
to a standard factorial expansion? That is, what  tokens
should be adopted for representing these expansions?

(Of course, the main name of the sequence A060112 SHOULD be:
"Sums of nonconsecutive factorial numbers".)


Yours,

Antti