login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175208 a(1) = 1, a(2) = 7, for n >= 3, a(n) = smallest prime such that a(n) mod a(n-1) = a(n-2). 1
1, 7, 29, 181, 4373, 61403, 2583299, 41394187, 85371673, 895110917, 16197368179, 98079319991, 800831928107, 3301407032419, 159268369484219, 5736962708464303, 46054970037198643, 4703343906502725889, 18859430596048102199, 155578788674887543481, 4375065513492899319667 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

It appears that the definition should include the condition that the sequence is strictly increasing - true? - N. J. A. Sloane, Jan 27 2019

LINKS

Charlie Neder, Table of n, a(n) for n = 1..33

CROSSREFS

Cf. A175093, A175094, A175207.

Sequence in context: A266473 A297677 A287860 * A307954 A071918 A183434

Adjacent sequences:  A175205 A175206 A175207 * A175209 A175210 A175211

KEYWORD

nonn

AUTHOR

Jaroslav Krizek, Mar 04 2010

EXTENSIONS

a(12)-a(20) from Charlie Neder, Jan 25 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 8 02:18 EDT 2020. Contains 333312 sequences. (Running on oeis4.)