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-3 of 3 results.

A330440 Numbers k such that A316774(k) != A316774(j) for all 0 <= j < k.

Original entry on oeis.org

0, 1, 2, 4, 5, 8, 11, 14, 22, 28, 32, 42, 45, 48, 68, 71, 77, 89, 92, 95, 108, 115, 140, 149, 194, 216, 254, 257, 260, 263, 268, 277, 295, 298, 310, 340, 346, 362, 365, 424, 431, 462, 476, 479, 486, 539, 560, 576, 579, 657, 692, 707, 754, 757, 794, 797, 928
Offset: 1

Views

Author

Alois P. Heinz, Dec 14 2019

Keywords

Comments

This is a sorted version of A316905.
List of indices k such that A330439(k) = 1.

Links

Crossrefs

Cf. A316774, A316905, A330439.
Column k=1 of A330587.

Programs

  • Maple
    b:= proc() 0 end:
g:= proc(n) option remember; local t;
      t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
      b(t):= b(t)+1; t
    end:
f:= proc(n) option remember; b(g(n)) end:
a:= proc(n) option remember; local k; for k from 1+
      `if`(n=1, -1, a(n-1)) while f(k)<>1 do od; k
    end:
seq(a(n), n=1..80);
  • Mathematica
    b[_] = 0;
g[n_] := g[n] = Module[{t},
     t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]];
     b[t]++; t];
f[n_] := f[n] = b[g[n]];
a[n_] := a[n] = Module[{k}, For[k = 1 +
     If[n == 1, -1, a[n - 1]], f[k] != 1, k++]; k];
Table[a[n], {n, 1, 80}] (* Jean-François Alcover, Jun 01 2022, after Alois P. Heinz *)

Formula

{ k >= 0 : A330439(k) = 1 }.

A330588 a(n) is the first index m such that A330439(m) = n.

Original entry on oeis.org

0, 3, 6, 13, 21, 23, 27, 33, 46, 67, 81, 104, 107, 114, 129, 166, 169, 172, 193, 261, 267, 276, 287, 311, 373, 430, 457, 478, 485, 590, 596, 656, 691, 768, 789, 796, 873, 941, 969, 1047, 1093, 1149, 1170, 1239, 1303, 1349, 1491, 1533, 1555, 1567, 1805, 1808
Offset: 1

Views

Author

Alois P. Heinz, Dec 18 2019

Keywords

Links

Crossrefs

Row n=1 of A330587.
Cf. A316774, A330439.

Programs

  • Maple
    b:= proc() 0 end:
g:= proc(n) option remember; local t;
      t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
      b(t):= b(t)+1; t
    end:
f:= proc(n) option remember; b(g(n)) end:
a:= proc() local l, t; t, l:= -1, proc() -1 end;
      proc(k) local h;
        while l(k)<0 do t:= t+1; h:= f(t);
          if l(h)<0 then l(h):= t fi
        od: l(k)
      end
    end():
seq(a(n), n=1..60);
  • Mathematica
    b[_] = 0;
g[n_] := g[n] = Module[{t}, t = If[n < 2, n, b[g[n-1]] + b[g[n-2]]]; b[t]++; t];
f[n_] := f[n] = b[g[n]];
A[n_, k_] := Module[{l, t = -1, h}, l[_] = {}; While[Length[l[k]] < n, t++; h = f[t]; AppendTo[l[h], t]]; l[k][[n]]];
a[k_] := A[1, k];
Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Dec 13 2023, after Alois P. Heinz *)

A330589 The n-th index m such that A330439(m) = n.

Original entry on oeis.org

0, 7, 12, 29, 59, 72, 85, 142, 190, 205, 238, 270, 305, 318, 402, 492, 619, 652, 795, 845, 950, 996, 1121, 1163, 1228, 1393, 1548, 1662, 1756, 1920, 1937, 2106, 2202, 2351, 2448, 2555, 2594, 2707, 2788, 3254, 3420, 3466, 3663, 3974, 4136, 4282, 4363, 4621, 4732
Offset: 1

Views

Author

Alois P. Heinz, Dec 18 2019

Keywords

Links

Crossrefs

Main diagonal of A330587.
Cf. A316774, A330439.

Programs

  • Maple
    b:= proc() 0 end:
g:= proc(n) option remember; local t;
      t:= `if`(n<2, n, b(g(n-1))+b(g(n-2)));
      b(t):= b(t)+1; t
    end:
f:= proc(n) option remember; b(g(n)) end:
a:= proc() local a, b, t; a, b, t:= proc() end, proc() 0 end, -1;
      proc(k) local h;
        while b(k)

Formula

a(n) = A330587(n,n).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.