login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156615 a(1)=2, a(n+1) is the smallest prime > n*final digit of a(n). 6
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

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

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)] ;

CROSSREFS

Sequence in context: A072214 A007660 A158055 * A158054 A134412 A005115

Adjacent sequences:  A156612 A156613 A156614 * A156616 A156617 A156618

KEYWORD

nonn,base,less

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Feb 11 2009

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.