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.

A156615 a(1)=2, a(n+1) is the smallest prime > n*final digit of a(n).

Original entry on oeis.org

2, 3, 7, 23, 13, 17, 43, 23, 29, 83, 31, 13, 37, 97, 101, 17, 113, 53, 59, 173, 61, 23, 67, 163, 73, 79, 239, 251, 29, 263, 97, 223, 97, 233, 103, 107, 257, 263, 127, 277, 281, 43, 127, 307, 311, 47, 331, 53, 149, 443, 151, 53, 157, 373, 163, 167
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Feb 11 2009

Keywords

Examples

			2, 3 (>2=1*2), 7 (>6=2*3), 23 (>21=3*7).
		

Programs

  • Maple
    A010879 := proc(n) n mod 10 ;end:A156615 := proc(n) option remember ; if n = 1 then 2; else nextprime((n-1)*A010879(procname(n-1))) ; fi; end: L := [seq(A156615(n),n=1..80)] ;
  • PARI
    print1(t=2);for(n=2,99,print1(", ", t=nextprime(t%10*n))) \\ Charles R Greathouse IV, Dec 29 2012

Extensions

Corrected from a(2) on, corrected erroneous examples. Added keywords base,less R. J. Mathar, Feb 13 2009