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.

A258469 Numbers m such that A062234(m) != A062234(m+1).

Original entry on oeis.org

9, 10, 11, 12, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 66, 67, 68, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 91
Offset: 1

Views

Author

Reinhard Zumkeller, May 31 2015

Keywords

Comments

a(n) = A258432(m), where m such that A258383(m) = 1.

Examples

			a(1) = A258437(A258432(1)) = 9.
		

Crossrefs

Programs

  • Haskell
    a258469 n = a258469_list !! (n-1)
    a258469_list = map a258432 $ filter ((== 1) . a258383) [1..]