A251643 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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.

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 * A346531 A070710 A048759

Adjacent sequences: A251640 A251641 A251642 * A251644 A251645 A251646

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Dec 19 2014

STATUS

approved