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.

A270432 a(n) = number of terms A270430 <= n; least monotonic left inverse of A270430.

Original entry on oeis.org

1, 2, 3, 4, 5, 5, 5, 6, 7, 8, 8, 9, 10, 10, 10, 11, 12, 12, 12, 13, 13, 13, 13, 13, 14, 15, 16, 16, 17, 18, 19, 20, 21, 22, 22, 23, 24, 24, 25, 26, 27, 28, 28, 28, 28, 28, 28, 29, 30, 31, 31, 32, 33, 33, 33, 33, 33, 34, 34, 34, 34, 35, 35, 36, 37, 37, 37, 38, 39, 39, 39, 39, 39, 40, 41, 41, 42, 42, 42, 43, 44, 45
Offset: 1

Views

Author

Antti Karttunen, Mar 17 2016

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_] := (Times @@ Power[If[# == 1, 1, NextPrime@ #] & /@ First@ #, Last@ #] + 1)/2 &@ Transpose@ FactorInteger@ n; g[n_] := Times @@ Power[If[# == 1, 1, NextPrime[#, -1]] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger[2 n - 1]; s = Select[Range@ 144, Xor[EvenQ@ f@ #, OddQ@ g@ #] &]; Table[Count[s, k_ /; k <= n], {n, 84}] (* Michael De Vlieger, Mar 17 2016 *)

Formula

a(1) = 1, for n > 1, a(n) = 1-(A048673(n)-A064216(n) reduced modulo 2) + a(n-1).
Other identities. For all n >= 1:
a(n) = n - A270433(n).
a(A270430(n)) = n.