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.

Showing 1-2 of 2 results.

A256914 Trace of the enhanced squares representation of n.

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 2, 3, 1, 9, 1, 2, 3, 4, 1, 2, 16, 1, 2, 3, 4, 1, 2, 3, 1, 25, 1, 2, 3, 4, 1, 2, 3, 1, 9, 1, 36, 1, 2, 3, 4, 1, 2, 3, 1, 9, 1, 2, 3, 49, 1, 2, 3, 4, 1, 2, 3, 1, 9, 1, 2, 3, 4, 1, 64, 1, 2, 3, 4, 1, 2, 3, 1, 9, 1, 2, 3, 4, 1, 2, 16, 81, 1, 2
Offset: 0

Views

Author

Clark Kimberling, Apr 14 2015

Keywords

Comments

See A256913 for definitions.
a(A257046(n)) = 1; a(A257047(n)) != 1. - Reinhard Zumkeller, Apr 15 2015

Examples

			R(0) = 0, so trace = 0.
R(1) = 1, so trace = 1.
R(8) = 4 + 3 + 1, so trace = 1.
R(43) = 36 + 4 + 3, so trace = 3.
		

Crossrefs

Cf. A000290, A256913, A256915 (number of terms).

Programs

  • Haskell
    a256914 = last . a256913_row  -- Reinhard Zumkeller, Apr 15 2015
  • Mathematica
    b[n_] := n^2; bb = Insert[Table[b[n], {n, 0, 100}]  , 2, 3];
    s[n_] := Table[b[n], {k, 1, 2 n + 1}];
    h[1] = {0, 1, 2, 3}; h[n_] := Join[h[n - 1], s[n]];
    g = h[100]; Take[g, 100]
    r[0] = {0}; r[1] = {1}; r[2] = {2}; r[3] = {3}; r[8] = {4, 3, 1};
    r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, r[n - g[[n]]]]];
    t = Table[r[n], {n, 0, 120}] (* A256913, before concatenation *)
    Flatten[t]  (* A256913 *)
    Table[Last[r[n]], {n, 0, 120}]    (* A256914 *)
    Table[Length[r[n]], {n, 0, 200}]  (* A256915 *)

A257047 Numbers not having trace 1 in their enhanced squares representation, see A256913.

Original entry on oeis.org

0, 2, 3, 4, 6, 7, 9, 11, 12, 13, 15, 16, 18, 19, 20, 22, 23, 25, 27, 28, 29, 31, 32, 34, 36, 38, 39, 40, 42, 43, 45, 47, 48, 49, 51, 52, 53, 55, 56, 58, 60, 61, 62, 64, 66, 67, 68, 70, 71, 73, 75, 76, 77, 79, 80, 81, 83, 84, 85, 87, 88, 90, 92, 93, 94, 96
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 15 2015

Keywords

Comments

A256914(a(n)) != 1.

Crossrefs

Cf. A256913, A256914, A257046 (complement).

Programs

  • Haskell
    a257047 n = a257047_list !! (n-1)
    a257047_list = filter ((/= 1) . a256914) [0..]
Showing 1-2 of 2 results.