cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A086525 a(n) = a(( a(n-2))*(1-mod(n,2))+a(n-1)*(mod(n,2))) + a((n - a(n-2))*(1-mod(n,2))+(n-a(n-1))*(mod(n,2))).

Original entry on oeis.org

1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 13, 13, 14, 15, 16, 16, 17, 18, 18, 19, 20, 20, 21, 22, 23, 23, 24, 25, 25, 26, 27, 27, 28, 29, 30, 30, 31, 32, 32, 33, 34, 34, 35, 36, 37, 37, 38, 39, 40, 40, 41, 42, 42, 43, 44, 44, 45, 46, 47, 47, 48, 49, 50, 50, 51, 52, 52
Offset: 1

Views

Author

Roger L. Bagula, Sep 14 2003

Keywords

Comments

The sequence o2 mentioned in A086841.

Crossrefs

Programs

  • Mathematica
    digits=200 Mc[n_Integer?Positive] :Mc[n] =Mc[( Mc[n-2])*(1-Mod[n, 2])+Mc[n-1]*(Mod[n, 2])] + Mc[(n - Mc[n-2])*(1-Mod[n, 2])+(n-Mc[n-1])*(Mod[n, 2])] Mc[1] = Mc[2] = 1 a1=Table[Mc[n], {n, 1, digits}]

Extensions

Edited by N. J. A. Sloane, Nov 07 2007