A316905 -id:A316905 - cp's OEIS frontend

A330448 a(n) = A330447(n) - A316905(n).

0, 0, 0, 0, 1, 0, 0, 0, 8, 0, 4, 0, 0, 3, 0, 0, 0, 0, 0, 0, 23, 0, 45, 0, 0, 0, 74, 8, 0, 56, 47, 0, 0, 105, 67, 85, 64, 0, 130, 45, 111, 0, 21, 136, 74, 98, 0, 97, 0, 0, 35, 0, 0, 0, 37, 0, 0, 0, 52, 0, 104, 52, 67, 0, 0, 70, 0, 0, 0, 0, 0, 152, 0, 0, 0, 0, 0

Offset: 0

Alois P. Heinz, Dec 15 2019

Alois P. Heinz, Table of n, a(n) for n = 0..20000

Cf. A316774, A316905, A330447.

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() local t, a; t, a:= -1, proc() -1 end;
      proc(n) local h;
        while a(n) = -1 do
          t:= t+1; h:= g(t);
          if a(h) = -1 then a(h):= t fi
        od; a(n)
      end
    end():
h:= proc(n) option remember; `if`(n<0, 0,
      max(h(n-1), f(n)))
    end:
a:= n-> h(n)-f(n):
seq(a(n), n=0..100);

b[_] = 0;
g[n_] := g[n] = Module[{t}, t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]]; b[t] = b[t] + 1; t];
f[n_] := Module[{t, a}, t = -1; a[_] = -1; Module[{h}, While[a[n] == -1, t = t + 1; h = g[t]; If[a[h] == -1, a[h] = t]]; a[n]]];
h[n_] := h[n] = If[n < 0, 0, Max[h[n - 1], f[n]]];
a[n_] := h[n] - f[n];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 13 2023, after Alois P. Heinz *)

A316774 a(n) = n for n < 2, a(n) = freq(a(n-1),n) + freq(a(n-2),n) for n >= 2, where freq(i,j) is the number of times i appears in [a(0),a(1),...,a(j-1)].

Original entry on oeis.org

0, 1, 2, 2, 4, 3, 2, 4, 5, 3, 3, 6, 4, 4, 8, 5, 3, 6, 6, 6, 8, 6, 7, 6, 7, 8, 5, 6, 10, 8, 5, 8, 9, 6, 9, 10, 4, 7, 8, 9, 9, 8, 11, 8, 9, 13, 6, 10, 12, 4, 7, 10, 8, 13, 11, 4, 9, 13, 9, 10, 12, 7, 7, 12, 9, 11, 11, 8, 14, 11, 6, 15, 11, 7, 13, 11, 11, 16, 9, 10

Offset: 0

Peter Illig, Jul 12 2018

In other words, a(n) = (number of times a(n-1) has appeared) plus (number of times a(n-2) has appeared). - N. J. A. Sloane, Dec 13 2019
What is the asymptotic behavior of this sequence?
Does it contain every positive integer at least once?
Does it contain every positive integer at most finitely many times?
Additional comments from Peter Illig's "Puzzles" link below (Start):
Sometimes referred to as "The Devil's Sequence" (by me), due to the early presence of three consecutive 6's (and my inability to understand it). The next time a number occurs three times in a row isn't until a(355677).
If each n does appear only finitely many times, approximately how many times does it appear? (It seems to be close to 2n.)
What are the best possible upper/lower bounds on a(n)?
Let r(k) be the smallest n such that {0,1,2,...,k} is contained in {a(0),...,a(n)}. What is the asymptotic behavior of r(k)? (It seems to be close to k^2/2.)
(End)

			For n=4, a(n-1) = a(n-2) = 2, and 2 appears twice in the first 4 terms. So a(4) = 2 + 2 = 4.

Alois P. Heinz, Table of n, a(n) for n = 0..65536
"Horseshoe_Crab" Reddit User, Properties of a Strange, Rather Meta Sequence. [In case this link breaks, the main point of the discussion is to propose the sequence and suggest other initial values. - _N. J. A. Sloane_, Dec 13 2019]
Peter Illig, Problems. [No date, probably 2018]
Samuel B. Reid, Density plot of one billion terms
Rémy Sigrist, Density plot of the first 10000000 terms

Cf. A001462, A316973 (freq(n)), A316905 (when n appears), A316984 (when n last appears), A330439 (total number of times a(n) has appeared so far).
For records see A330330, A330331.
See A306246 and A329934 for similar sequences with different initial conditions.
A330332 considers the frequencies of the three previous terms.

b:= proc() 0 end:
a:= proc(n) option remember; local t;
      t:= `if`(n<2, n, b(a(n-1))+b(a(n-2)));
      b(t):= b(t)+1; t
    end:
seq(a(n), n=0..200);  # Alois P. Heinz, Jul 12 2018

a = prev = {0, 1};
Do[
AppendTo[prev, Count[a, prev[[1]]] + Count[a, prev[[2]]]];
AppendTo[a, prev[[3]]];
prev = prev[[2 ;;]] , {78}]
a (* Peter Illig, Jul 12 2018 *)

from itertools import islice
from collections import Counter
def agen():
    a = [0, 1]; c = Counter(a); yield from a
    while True:
        a = [a[-1], c[a[-1]] + c[a[-2]]]; c[a[-1]] += 1; yield a[-1]
print(list(islice(agen(), 80))) # Michael S. Branicky, Oct 13 2022

Definition clarified by N. J. A. Sloane, Dec 13 2019

A316973 a(n) is the number of occurrences of n in A316774.

Original entry on oeis.org

1, 1, 3, 4, 7, 7, 15, 12, 18, 16, 25, 23, 14, 22, 26, 33, 23, 38, 32, 35, 45, 49, 41, 44, 58, 49, 59, 39, 49, 69, 54, 57, 57, 75, 79, 62, 75, 76, 74, 81, 75, 78, 74, 90, 86, 86, 88, 78, 78, 105, 106, 109, 129, 91, 92, 111, 108, 101, 126, 130, 116, 129, 133, 140

Offset: 0

Alois P. Heinz, Jul 17 2018

These values may be only conjectural, in which case the b-file should be changed to an a-file and marked as conjectured. - N. J. A. Sloane, Dec 14 2019

			a(4) = 7 because A316774(j) = 4 for j in s = {4,7,12,13,36,49,55} and |s| = 7.

Alois P. Heinz, Table of n, a(n) for n = 0..5000
Altug Alkan, A plot of a(n)-2*n (conjectural)

Cf. A316774, A316905, A316984.

a(n) = |{ j : A316774(j) = n }|.

A316984 a(n) is the index of the last occurrence of n in A316774.

Original entry on oeis.org

0, 1, 6, 16, 55, 488, 314, 367, 279, 562, 519, 799, 500, 694, 792, 876, 1322, 1598, 5826, 1814, 6102, 5345, 2042, 5105, 2949, 3288, 5260, 4971, 6353, 5172, 8596, 3193, 6528, 8065, 8194, 6538, 6881, 6966, 7963, 5993, 8114, 9090, 8457, 8948, 12703, 9994, 6568

Offset: 0

Alois P. Heinz, Jul 18 2018

[It may be that these values are only conjectural. If so, the b-file should be changed to an a-file and marked as conjectured. - N. J. A. Sloane, Dec 14 2019]

			a(4) = 55 because A316774(j) = 4 for j in {4,7,12,13,36,49,55} with maximal element 55.

Alois P. Heinz, Table of n, a(n) for n = 0..5000

Cf. A316774, A316905, A316973.

a(n) = max { j >= 0 : A316774(j) = n }.

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

Alois P. Heinz, Dec 14 2019

nonn

This is a sorted version of A316905.

List of indices k such that A330439(k) = 1.

Alois P. Heinz, Table of n, a(n) for n = 1..25000

Cf. A316774, A316905, A330439.

Column k=1 of A330587.

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);

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 *)

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

A330330 Record high points in A316774.

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 8, 10, 11, 13, 14, 15, 16, 17, 20, 22, 23, 26, 29, 33, 35, 36, 38, 40, 43, 45, 47, 48, 50, 51, 52, 54, 55, 56, 58, 60, 62, 65, 66, 71, 72, 73, 74, 75, 77, 78, 80, 81, 83, 84, 91, 98, 102, 111, 112, 118, 120, 124, 131, 136, 139, 144, 145, 147, 149, 152, 156, 159, 160, 163

Offset: 1

N. J. A. Sloane, Dec 14 2019

nonn

Rémy Sigrist, Table of n, a(n) for n = 1..8000 (first 151 terms from N. J. A. Sloane)

Cf. A316774, A316905, A316984, A330331.

A330331 Positions of records in A316774.

Original entry on oeis.org

0, 1, 2, 4, 8, 11, 14, 28, 42, 45, 68, 71, 77, 89, 92, 95, 149, 194, 254, 257, 277, 298, 346, 365, 424, 462, 479, 579, 657, 707, 754, 757, 797, 928, 1107, 1110, 1147, 1150, 1295, 1298, 1453, 1456, 1462, 1590, 1593, 1673, 1676, 1819, 1822, 1982, 2095, 2395, 2593, 2665, 2874, 3355, 3724, 3873, 4131, 4359, 4510

Offset: 1

N. J. A. Sloane, Dec 14 2019

nonn

Rémy Sigrist, Table of n, a(n) for n = 1..8000 (first 151 terms from N. J. A. Sloane)

Cf. A316774, A316905, A316984, A330330.

A330447 a(n) is the smallest index k such that {0,1,2,...,n} is a subset of { A316774(j) : 0 <= j <= k }.

Original entry on oeis.org

0, 1, 2, 5, 5, 8, 11, 22, 22, 32, 32, 42, 48, 48, 68, 71, 77, 89, 108, 115, 115, 140, 140, 149, 216, 268, 268, 268, 310, 310, 310, 340, 362, 362, 362, 362, 362, 476, 476, 476, 476, 560, 560, 560, 560, 560, 576, 576, 579, 692, 692, 707, 754, 794, 794, 797, 928

Offset: 0

Alois P. Heinz, Dec 15 2019

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..20000

Cf. A316774, A316905, A330448.

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() local t, a; t, a:= -1, proc() -1 end;
      proc(n) local h;
        while a(n) = -1 do
          t:= t+1; h:= g(t);
          if a(h) = -1 then a(h):= t fi
        od; a(n)
      end
    end():
a:= proc(n) option remember; `if`(n<0, 0,
      max(a(n-1), f(n)))
    end:
seq(a(n), n=0..100);

b[_] = 0;
g[n_] := g[n] = Module[{t}, t = If[n < 2, n, b[g[n - 1]] + b[g[n - 2]]]; b[t] = b[t] + 1; t];
f[n_] := Module[{t, a}, t = -1; a[_] = -1; Module[{h}, While[a[n] == -1, t = t + 1; h = g[t]; If[a[h] == -1, a[h] = t]]; a[n]]];
a[n_] := a[n] = If[n < 0, 0, Max[a[n - 1], f[n]]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Oct 13 2022, after Alois P. Heinz *)

a(n) = max_{0 <= j <= n} A316905(j).
a(n) >= A316905(n).
a(n) <= a(n+1).

cp's OEIS Frontend

A330448 a(n) = A330447(n) - A316905(n).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

A316774 a(n) = n for n < 2, a(n) = freq(a(n-1),n) + freq(a(n-2),n) for n >= 2, where freq(i,j) is the number of times i appears in [a(0),a(1),...,a(j-1)].

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Python

Extensions

A316973 a(n) is the number of occurrences of n in A316774.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A316984 a(n) is the index of the last occurrence of n in A316774.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A330330 Record high points in A316774.

Views

Author

Keywords

Links

Crossrefs

A330331 Positions of records in A316774.

Views

Author

Keywords

Links

Crossrefs

A330447 a(n) is the smallest index k such that {0,1,2,...,n} is a subset of { A316774(j) : 0 <= j <= k }.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula