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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113964 a(n) = (A113963(n)) + (A113963(n+1)). 3

%I #13 Sep 29 2017 02:50:47

%S 5,11,9,7,13,11,13,23,19,17,25,23,25,35,31,29,37,43,38,37,47,43,44,47,

%T 50,53,55,58,59,67,73,66,61,70,67,69,73,74,83,79,77,85,91,89,92,103,

%U 98,94,95,97,106,103,105,109,110,119,115,113,115,118,127,133,131,130,127

%N a(n) = (A113963(n)) + (A113963(n+1)).

%C |(A113965(n))| does not divide (A113964(n)).

%H Michael De Vlieger, <a href="/A113964/b113964.txt">Table of n, a(n) for n = 1..10000</a>

%t Block[{a = {1}, k}, Do[k = 2; While[Nand[FreeQ[a, k], ! Divisible[k + a[[i - 1]], Abs[k - a[[i - 1]] ]]], k++]; AppendTo[a, k], {i, 2, 66}]; Total /@ Partition[a, 2, 1]] (* _Michael De Vlieger_, Sep 28 2017 *)

%Y Cf. A113963, A113965.

%K nonn

%O 1,1

%A _Leroy Quet_, Nov 10 2005

%E Extended by _Ray Chandler_, Nov 13 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:39 EDT 2024. Contains 371920 sequences. (Running on oeis4.)