cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A283363 Absolute values of first differences of A090396.

This page as a plain text file.
%I A283363 #19 Mar 23 2017 14:39:57
%S A283363 1,0,0,2,2,3,3,4,8,3,1,1,3,12,0,2,0,2,2,0,2,21,3,7,7,5,5,26,2,12,12,
%T A283363 19,11,18,14,16,20,17,21,20,24,23,23,20,18,21,15,32,20,29,21,25,33,20,
%U A283363 36,19,23,36,24,33,23,15,47,20,22,14,54,9,13,15,15,60,12,12,14,14,12,65
%N A283363 Absolute values of first differences of A090396.
%C A283363 See the beginning of helix in scatterplot link at Links section.
%H A283363 Altug Alkan, <a href="/A283363/b283363.txt">Table of n, a(n) for n = 1..10000</a>
%H A283363 Altug Alkan, <a href="/A283363/a283363_1.png">Alternative Scatterplot of A283363</a>
%H A283363 Altug Alkan, <a href="/A283363/a283363_2.png">Alternative Graph of A283363</a>
%F A283363 a(n) = abs(A090396(n+1) - A090396(n)).
%e A283363 a(5) = 2 because a(5) = abs(A090396(6) - A090396(5)) = abs(5 - 3) = 2.
%t A283363 A[n_] := Mod[Sum[Prime[k], {k, n}], n];  Table[Abs[A[n+1] - A[n]],{n, 78}] (* _Indranil Ghosh_, Mar 06 2017 *)
%o A283363 (PARI) a090396(n) = sum(k=1, n, prime(k)) % n;
%o A283363 a(n) = abs(a090396(n+1) - a090396(n));
%Y A283363 Cf. A090396.
%K A283363 nonn,look
%O A283363 1,4
%A A283363 _Altug Alkan_, Mar 06 2017