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

A258768 Fixed points in A258767.

Original entry on oeis.org

1, 8, 13, 34, 45, 49, 51, 80, 86, 92, 98, 146, 163, 164, 206, 216, 266, 279, 303, 312, 333, 337, 348, 356, 359, 371, 387, 388, 398, 406, 421, 432, 445, 460, 463, 465, 509, 517, 533, 536, 546, 548, 572, 576, 585, 602, 607, 612, 624, 638, 658, 666, 669, 675, 688, 704, 711, 734, 744, 765, 771, 801, 810, 814
Offset: 1

Views

Author

Derek Orr, Jun 09 2015

Keywords

Comments

Numbers n such that A258767(n) = n.
Also fixed points of A258827. - Reinhard Zumkeller, Jun 11 2015

Crossrefs

Programs

  • Haskell
    a258768 n = a258768_list !! (n-1)
    a258768_list = [x | x <- [1..], a258767 x == x]
    -- Reinhard Zumkeller, Jun 11 2015
  • PARI
    print1(1, ", "); v=[1]; n=1; while(#v<10^3, if(!issquarefree(n^2+v[#v]^2)&&!vecsearch(vecsort(v), n), v=concat(v, n); if(n==#v, print1(n, ", ")); n=0); n++)
    

A258827 Smallest m such that A258767(m) = n.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Jun 11 2015

Keywords

Comments

If A258767 is a permutation, this sequence is its inverse.

Crossrefs

Cf. A258767, A258768 (fixed points).

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a258827 = (+ 1) . fromJust . (`elemIndex` a258767_list)
Showing 1-2 of 2 results.