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.

A020948 Least k such that b(k) = n, where b( ) is sequence A020944.

Original entry on oeis.org

1, 8, 16, 32, 34, 128, 66, 68, 130, 134, 132, 140, 138, 260, 264, 284, 268, 266, 274, 572, 276, 524, 522, 536, 534, 530, 538, 1034, 532, 548, 556, 1046, 1042, 554, 1050, 1082, 1044, 2072, 1092, 1064, 1060, 2114, 1068, 1076, 1132, 1100, 1066, 2102, 1098, 1106, 2088, 2084, 2098, 4346, 1108
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = Which[n < 2, Boole[n == 1] - Boole[n == 0], OddQ[n], Abs[a[n - 1] - a[n - 2]], True, a[n/2] + a[n/2 - 1]]; s = Array[a[#] &, 4200]; Array[FirstPosition[s, #][[1]] &, LengthWhile[Differences@ Union@ s, # == 1 &]] (* Michael De Vlieger, Feb 18 2022, after Michael Somos at A020944 *)

Extensions

More terms from Seiichi Manyama, Feb 18 2022