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.

A059991 a(n) = 2^(n-2^ord_2(n)) (or 2^(n-A006519(n))).

Original entry on oeis.org

1, 1, 4, 1, 16, 16, 64, 1, 256, 256, 1024, 256, 4096, 4096, 16384, 1, 65536, 65536, 262144, 65536, 1048576, 1048576, 4194304, 65536, 16777216, 16777216, 67108864, 16777216, 268435456, 268435456, 1073741824, 1, 4294967296, 4294967296
Offset: 1

Views

Author

Thomas Ward, Mar 08 2001

Keywords

Comments

Number of points of period n in the simplest nontrivial disconnected S-integer dynamical system.
This sequence comes from the simplest disconnected S-integer system that is not hyperbolic. In the terminology of the papers referred to, it is constructed by choosing the under- lying field to be F_2(t), the element to be t and the nontrivial valuation to correspond to the polynomial 1+t. Since it counts periodic points, it satisfies the nontrivial congruence sum_{d|n}mu(d)a(n/d) = 0 mod n for all n and since it comes from a group automorphism it is a divisibility sequence.

Examples

			a(24) = 2^16 = 65536 because ord_2(24)=3, so 24-2^ord_2(24)=16.
		

Crossrefs

Programs

  • Maple
    readlib(ifactors): for n from 1 to 100 do if n mod 2 = 1 then ord2 := 0 else ord2 := ifactors(n)[2][1][2] fi: printf(`%d,`, 2^(n-2^ord2)) od:
  • Mathematica
    ord2[n_?OddQ] = 0; ord2[n_?EvenQ] := FactorInteger[n][[1, 2]]; a[n_] := 2^(n-2^ord2[n]); a /@ Range[34]
    (* Jean-François Alcover, May 19 2011, after Maple prog. *)

Extensions

More terms from James Sellers, Mar 15 2001