cp's OEIS Frontend

A199969 a(n) = the greatest non-divisor h of n (1 < h < n), or 0 if no such h exists.

%I A199969 #42 Oct 18 2023 09:23:07
%S A199969 0,0,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,
%T A199969 26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,
%U A199969 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75
%N A199969 a(n) = the greatest non-divisor h of n (1 < h < n), or 0 if no such h exists.
%C A199969 From _Paul Curtz_, Feb 09 2015: (Start)
%C A199969 The nonnegative numbers with 0 instead of 1. See A254667(n), which is linked to the Bernoulli numbers A164555(n)/A027642(n), an autosequence of the second kind.
%C A199969 Offset 0 could be chosen.
%C A199969 An autosequence of the second kind is a sequence whose main diagonal is the first upper diagonal multiplied by 2. If the first upper diagonal is
%C A199969 s0, s1, s2, s3, s4, s5, ...,
%C A199969 the sequence is
%C A199969 Ssk(n) = 2*s0, s0, s0 + 2*s1, s0 +3*s1, s0 + 4*s1 + 2*s2, s1 + 5*s1 + 5*s2, etc.
%C A199969 The corresponding coefficients are A034807(n), a companion to A011973(n).
%C A199969 The binomial transform of Ssk(n) is (-1)^n*Ssk(n).
%C A199969 Difference table of a(n):
%C A199969    0,  0, 2, 3, 4, 5, 6, 7, ...
%C A199969    0,  2, 1, 1, 1, 1, 1, ...
%C A199969    2, -1, 0, 0, 0, 0 ...
%C A199969   -3,  1, 0, 0, 0, ...
%C A199969    4, -1, 0, 0, ...
%C A199969   -5,  1, 0, ...
%C A199969    6, -1, ...
%C A199969    7, ...
%C A199969   etc.
%C A199969 a(n) is an autosequence of the second kind. See A054977(n).
%C A199969 The corresponding autosequence of the first kind (a companion) is 0, 0 followed by the nonnegative numbers (A001477(n)). Not in the OEIS.
%C A199969 Ssk(n) = 2*Sfk(n+1) - Sfk(n) where Sfk(n) is the corresponding sequence of the first kind (see A254667(n)).
%C A199969 (End)
%C A199969 Number of binary sequences of length n-1 that contain exactly one 0 and at least one 1. - _Enrique Navarrete_, May 11 2021
%H A199969 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A199969 a(n) = n-1 for n >= 3.
%F A199969 E.g.f.: 1-x^2/2+(x-1)*exp(x). - _Enrique Navarrete_, May 11 2021
%t A199969 Join[{0,0},Table[Max[Complement[Range[n],Divisors[n]]],{n,3,70}]] (* or *) Join[{0,0},Range[2,70]] (* _Harvey P. Dale_, May 31 2014 *)
%o A199969 (PARI) if(n>2,n-1,0) \\ _Charles R Greathouse IV_, Sep 02 2015
%Y A199969 Cf. A199968 (the smallest non-divisor h of n (1<h<n)), A199970. A001477, A011973, A034807, A054977, A254667.
%Y A199969 Cf. A007978.
%Y A199969 Essentially the same as A000027, A028310, A087156 etc.
%K A199969 nonn,easy,less
%O A199969 1,3
%A A199969 _Jaroslav Krizek_, Nov 26 2011