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.

A247714 Position of A036561(n) in sequence A003586.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 6, 8, 10, 12, 9, 11, 14, 16, 19, 13, 15, 18, 21, 24, 27, 17, 20, 23, 26, 30, 33, 37, 22, 25, 29, 32, 36, 40, 44, 49, 28, 31, 35, 39, 43, 47, 52, 57, 62, 34, 38, 42, 46, 51, 55, 60, 66, 71, 77, 41, 45, 50, 54, 59, 64, 69, 75, 81, 87, 93, 48
Offset: 0

Views

Author

Michel Marcus, Sep 22 2014

Keywords

Comments

Motivated by L. Edson Jeffery comment in A036561 that says it is a permutation of A003586.

Crossrefs

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a247714 = (+ 1) . fromJust .
                      (`elemIndex` a003586_list) . (a036561_list !!)
    -- Reinhard Zumkeller, Sep 23 2014
  • Maple
    N0:= 10: # to get the first (N0+1)*(N0+2)/2 terms
    V:= 3^N0:
    S:= {seq(seq(2^i*3^j, i=0..ilog2(V/3^j)),j=0..N0)}:
    # in Maple 11 or earlier, uncomment the next line and comment out the previous one
    # S:= sort([seq(seq(2^i*3^j, i=0..ilog2(V/3^j)),j=0..N0)]):
    for k from 1 to nops(S) do
      r:= S[k];
      jr:= padic[ordp](r,3);
      ir:= jr + padic[ordp](r,2);
      A[1+jr+ir*(ir+1)/2] := k;
    od:
    seq(A[k],k=1..(N0+1)*(N0+2)/2); # Robert Israel, Sep 22 2014
  • PARI
    lista(nn) = {w = readvec("b036561.txt"); v = readvec("b003586.txt"); for (i=1, nn, print1(setsearch(v, w[i], 0), ", "););}