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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330723 Numbers k such that A033468(k) = A033468(k+1). 1

%I

%S 7,29,45,49,67,71,75,97,99,111,121,127,131,141,143,161,171,173,199,

%T 211,215,227,241,253,265,267,273,277,285,287,293,301,321,333,335,337,

%U 341,347,359,379,381,391,393,407,417,437,447,449,455,459,475,493,497,503,511,515,519,523,525,537,539

%N Numbers k such that A033468(k) = A033468(k+1).

%C Are all terms odd?

%C Does the sequence have nonzero asymptotic density?

%H Robert Israel, <a href="/A330723/b330723.txt">Table of n, a(n) for n = 1..10000</a>

%e a(1) = 7 is in the sequence because A033468(7) = A033468(8) = 204425.

%p S:= 0: R:= NULL: count:= 0: t:= 0:

%p for i from 0 while count < 100 do

%p S:= S + 1/(i^2+1);

%p s:= t; t:= denom(S);

%p if s = t then R:= R, i-1; count:= count+1 fi

%p od:

%p R;

%Y Cf. A033468.

%K nonn

%O 1,1

%A _Robert Israel_, Apr 27 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 1 03:56 EST 2023. Contains 359981 sequences. (Running on oeis4.)