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

A039645 Number of steps to fixed point of "k -> k/2 or (k+1)/2 until result is prime", starting with prime(n)+1.

Original entry on oeis.org

1, 2, 2, 3, 3, 2, 3, 3, 4, 5, 5, 2, 3, 3, 5, 4, 6, 2, 3, 5, 2, 5, 4, 3, 4, 4, 4, 5, 5, 3, 7, 4, 6, 6, 4, 4, 2, 3, 5, 5, 4, 4, 7, 2, 5, 5, 3, 6, 4, 4, 3, 8, 3, 8, 5, 5, 5, 5, 2, 3, 3, 4, 7, 7, 2, 7, 3, 4, 6, 6, 3, 5, 5, 4, 8, 8, 6, 2, 3, 3, 4, 2, 7, 3, 7, 7, 3, 2, 5, 5, 4, 9, 4, 5, 9, 9, 9, 3, 3, 2, 3, 8
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Haskell
    a039645 n = snd $ until ((== 1) . a010051 . fst)
                (\(x, i) -> ((x + 1) `div` 2 , i + 1)) (a000040 n + 1, 1)
    -- Reinhard Zumkeller, Nov 17 2013
  • Mathematica
    f[k_] := Which[PrimeQ[k], k, EvenQ[k], k/2, True, (k+1)/2];
    a[n_] := Length[FixedPointList[f, Prime[n] + 1]] - 1;
    Array[a, 102] (* Jean-François Alcover, Mar 01 2019 *)

Extensions

Offset corrected by Reinhard Zumkeller, Nov 17 2013

A039637 Number of steps to fixed point of "n -> n/2 or (n+1)/2 until result is prime".

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 4, 4, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 5, 1, 5, 2, 2, 4, 4, 1, 2, 4, 4, 1, 3, 1, 3, 2, 2, 1, 5, 3, 3, 3, 3, 1, 4, 4, 4, 2, 2, 1, 6, 1, 2, 6, 6, 3, 3, 1, 3, 5, 5, 1, 5, 1, 2, 3, 3, 5, 5, 1, 5, 2, 2, 1, 4, 2, 2, 4, 4, 1, 3, 3, 3, 2, 2, 6, 6, 1, 4, 4, 4, 1, 4
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Haskell
    a039637 1 = 1
    a039637 n = snd $ until ((== 1) . a010051 . fst)
                            (\(x, i) -> ((x + 1) `div` 2 , i + 1)) (n, 1)
    -- Reinhard Zumkeller, Nov 17 2013
  • Mathematica
    upplist[ n_Integer ] := Length/@Drop[ FixedPointList[ If[ EvenQ[ # ]&&#>2, #/ 2, If[ PrimeQ[ # ]||(#===1), #, (#+1)/2 ] ]&, n, 20 ], -1 ]

Extensions

Offset corrected by Reinhard Zumkeller, Nov 17 2013

A039640 Fixed point of "k -> k/2 or (k+1)/2 until result is prime", starting with prime(n)-1.

Original entry on oeis.org

1, 2, 2, 3, 5, 3, 2, 5, 11, 7, 2, 5, 5, 11, 23, 13, 29, 2, 17, 5, 5, 5, 41, 11, 3, 13, 13, 53, 7, 7, 2, 17, 17, 5, 37, 19, 5, 41, 83, 43, 89, 23, 3, 3, 13, 13, 53, 7, 113, 29, 29, 2, 2, 2, 2, 131, 67, 17, 5, 5, 71, 73, 5, 5, 5, 79, 83, 11, 173, 11, 11, 179, 23, 47, 3, 191, 97, 13
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Haskell
    a039640 1 = 1
    a039640 n = until ((== 1) . a010051) (flip div 2 . (+ 1)) (a000040 n - 1)
    -- Reinhard Zumkeller, Nov 17 2013
  • Mathematica
    (* See A039635. *)

Extensions

Offset corrected by Reinhard Zumkeller, Nov 17 2013

A039642 Number of steps to fixed point of "k -> k/2 or (k-1)/2 until result is prime", starting with prime(n)-1.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 4, 4, 2, 3, 3, 5, 4, 4, 2, 3, 2, 4, 6, 3, 6, 3, 2, 4, 6, 6, 6, 2, 4, 5, 3, 7, 4, 4, 3, 3, 4, 6, 2, 3, 2, 5, 3, 7, 7, 7, 5, 5, 2, 6, 4, 3, 6, 4, 8, 2, 3, 3, 5, 5, 5, 3, 5, 5, 5, 3, 4, 7, 2, 4, 6, 2, 6, 5, 4, 2, 3, 8, 8, 8, 6, 6, 3, 6, 3, 6, 7, 7, 7, 7, 2, 2, 7, 4, 5, 2, 3, 9, 9, 4, 6, 3
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Haskell
    a039642 1 = 1
    a039642 n = snd $ until ((== 1) . a010051 . fst)
                      (\(x, i) -> (x `div` 2 , i + 1)) (a000040 n - 1, 1)
    -- Reinhard Zumkeller, Nov 17 2013
  • Mathematica
    (* See A039636. *)

Extensions

Offset corrected by Reinhard Zumkeller, Nov 17 2013
Showing 1-4 of 4 results.