|
Search: id:A078190
|
|
| |
|
| 5, 23, 11, 71, 503, 62270207, 871782911, 121645100408831, 243290200817663, 304888344611713860501503, 137637530912263450463159795815809023, 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916863
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
More precisely, scan A004154, subtract 1, and record the answer if it is a prime. The sequence is not monotonic.
|
|
MAPLE
|
A004154 := proc(n) option remember ; local m ; if n <= 1 then RETURN(1) ; else m := A004154(n-1)*n ; while m mod 10 = 0 do m := m /10 ; end ; RETURN(m) ; fi ; end: n := 1 ; while true do f := A004154(n) : if isprime(f-1) then printf("%d, ", f-1) ; fi ; n := n+1 : od : - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2007
|
|
CROSSREFS
|
Cf. A004154, A078154, A078203, A078305.
Sequence in context: A002069 A120488 A054415 this_sequence A081319 A002582 A102723
Adjacent sequences: A078187 A078188 A078189 this_sequence A078191 A078192 A078193
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 23 2002
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2007
|
|
|
Search completed in 0.002 seconds
|
