[go: up one dir, main page]

login

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”).

A194367
Smallest k such that prime(n) divides k*prime(n+1)+1.
1
1, 1, 2, 5, 5, 3, 8, 14, 19, 14, 5, 9, 20, 32, 39, 44, 29, 10, 50, 35, 12, 59, 69, 11, 24, 50, 77, 53, 27, 8, 95, 109, 68, 125, 74, 25, 26, 122, 139, 144, 89, 18, 95, 48, 98, 116, 123, 167, 113, 57
OFFSET
1,3
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = (prime(n)*A069830(n) - 1)/prime(n+1). - Bob Selcoe, Aug 21 2016
EXAMPLE
a(4) = 5 as prime(4)=7 divides 5*11+1, where 11=prime(5).
a(7) = 8 = (17*9-1)/19. - Bob Selcoe, Aug 21 2016
MAPLE
seq(-ithprime(i+1)^(-1) mod ithprime(i), i=1..100); # Robert Israel, Aug 25 2016
MATHEMATICA
Table[k = 1; While[! Divisible[k Prime[n + 1] + 1, Prime@ n], k++]; k, {n, 50}] (* Michael De Vlieger, Aug 22 2016 *)
PROG
(PARI) a(n)=my(p=prime(n), q=nextprime(p+1)); lift(Mod(-1, p)/q) \\ Charles R Greathouse IV, Sep 03 2011
CROSSREFS
Cf. A077005.
Cf. A000040 (prime numbers), A069830.
Sequence in context: A362138 A190283 A272414 * A078312 A004582 A074269
KEYWORD
nonn,easy
AUTHOR
STATUS
approved