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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A251643 Smallest composite c such that F_(c-(c/p)) == 0 (mod c) with p = prime(n), F_k = A000045(k) and a/b the Kronecker symbol. 1
12, 12, 25, 168, 660, 323, 377, 442, 552, 442, 323, 1891, 442, 323, 323, 323, 377, 323, 377, 323, 323, 323, 323, 323, 442, 377, 442, 323, 377, 377, 377, 377, 2834, 442, 377, 377, 377, 2834, 323, 442, 1891, 442, 323, 442, 323, 1891, 323, 377, 323, 442, 323, 323 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Felix Fröhlich, Table of n, a(n) for n = 1..999

PROG

(PARI) forprime(p=1, 1e3, c=2; while(Mod(fibonacci(c-kronecker(c, p)), c)!=0 || ispseudoprime(c), c++); print1(c, ", "))

CROSSREFS

Sequence in context: A174020 A173549 A299853 * A070710 A048759 A303646

Adjacent sequences:  A251640 A251641 A251642 * A251644 A251645 A251646

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Dec 19 2014

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 August 18 13:25 EDT 2019. Contains 326100 sequences. (Running on oeis4.)