%I A112545
%S A112545 7,5,2,5,7,2,5,3,3,3,3,5,11,3,53,3,3,3,5,3,3,3,3,5,5,13,53,5,59,61,3,3,
%T A112545 11,5,3,157,3,3,173,3,5,11,97,7,3,211,3,113,5,3,3,5,3,257,263,3,3,3,5,
               7,
%U A112545 5,151,5,157,7,3,3,7,5,3,3,3,373,3,3,3,5,13,5,5,5,7,3,3,3,3,5,5,29,3,3
%N A112545 Least odd number k greater than 1 such that the sum of the predecessor 
               and successor primes of the n-th prime is divisible by k or if no 
               such odd k exists then 2.
%t A112545 f[n_] := Block[{k = 3, s = Prime[n - 1] + Prime[n + 1]}, While[Mod[s, 
               k] != 0 && k <= s, k += 2]; If[k > s, 2, k]]; Table[ f[n], {n, 2, 
               92}]
%Y A112545 Cf. A000040, A112686, A112681, A112794, A112731, A112789, A112795, A112796, 
               A112804, A112847, A112859, A113155, A113156, A113157, A113158.
%Y A112545 Sequence in context: A071876 A070404 A135537 this_sequence A021934 A021097 
               A087273
%Y A112545 Adjacent sequences: A112542 A112543 A112544 this_sequence A112546 A112547 
               A112548
%K A112545 nonn
%O A112545 2,1
%A A112545 Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 11 2006