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.

A319675 Sum of digits of prime(n) and digits of prime(n+1).

This page as a plain text file.
%I A319675 #21 Sep 08 2022 08:46:23
%S A319675 5,8,12,9,6,12,18,15,16,15,14,15,12,18,19,22,21,20,21,18,26,27,28,33,
%T A319675 18,6,12,18,15,15,15,16,24,27,21,20,23,24,25,28,27,21,24,30,36,23,11,
%U A319675 18,24,21,22,21,15,22,25,28,27,26,27,24,27,24,15,12,18,18
%N A319675 Sum of digits of prime(n) and digits of prime(n+1).
%e A319675 For n=6 , a(6) is the sum of digits of 13 and 17 which is 12.
%t A319675 Table[Plus@@IntegerDigits[Prime[n]] + Plus@@IntegerDigits[Prime[n + 1]], {n, 80}] (* _Vincenzo Librandi_, Sep 26 2018 *)
%o A319675 (Magma) [&+Intseq(NthPrime(n)) + &+Intseq(NthPrime(n+1)): n in [1..87]]; // _Vincenzo Librandi_, Sep 26 2018
%o A319675 (GAP) P:=Filtered([1..400],IsPrime);; List(List([1..Size(P)-1],i->ListOfDigits(P[i])+ListOfDigits(P[i+1])),Sum); # _Muniru A Asiru_, Sep 26 2018
%Y A319675 Cf. A007605, A045533.
%K A319675 nonn,easy,base
%O A319675 1,1
%A A319675 _Kei Ryan_, Sep 26 2018