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.

A299978 Lexicographic first sequence of positive integers such that a(n) + a(n+1) has a digit 8, and no term occurs twice.

Original entry on oeis.org

1, 7, 11, 17, 21, 27, 31, 37, 41, 39, 9, 19, 29, 49, 32, 6, 2, 16, 12, 26, 22, 36, 42, 38, 10, 8, 20, 18, 30, 28, 40, 43, 5, 3, 15, 13, 25, 23, 35, 33, 45, 44, 4, 14, 24, 34, 46, 52, 56, 62, 66, 72, 76, 82, 86, 92, 88, 50, 48, 60, 58, 70, 68, 80, 78, 90, 91, 47, 51, 57, 61, 67, 71, 77, 81, 87, 93, 55, 53, 65, 63, 75, 73, 85, 83, 95, 89, 59, 69, 79, 99
Offset: 1

Views

Author

M. F. Hasler and Eric Angelini, Feb 22 2018

Keywords

Comments

A permutation of the positive integers.

Crossrefs

Cf. A299988 (analog with nonnegative terms), A299957 (analog with digit 1), A299971, A299972, ..., A299979 (digit 0, 2, ..., 9).

Programs

  • PARI
    a(n,f=1,d=8,a=1,u=[a])={for(n=2,n,f&&if(f==1,print1(a","),write(f,n-1," "a));for(k=u[1]+1,oo,setsearch(u,k)&&next;setsearch(Set(digits(a+k)),d)&&(a=k)&&break);u=setunion(u,[a]);u[2]==u[1]+1&&u=u[^1]);a}