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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A200263 a(n) = 1 iff n-th prime has an odd digit sum. 3

%I

%S 0,1,1,1,0,0,0,0,1,1,0,0,1,1,1,0,0,1,1,0,0,0,1,1,0,0,0,0,0,1,0,1,1,1,

%T 0,1,1,0,0,1,1,0,1,1,1,1,0,1,1,1,0,0,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,1,

%U 0,0,1,1,0,1,1,0,0,1,1,1,0,1,0,0,0,1

%N a(n) = 1 iff n-th prime has an odd digit sum.

%C Characteristic function of A200260.

%H T. D. Noe, <a href="/A200263/b200263.txt">Table of n, a(n) for n = 1..1000</a>

%t If[OddQ[Total[IntegerDigits[#]]],1,0]&/@Prime[Range[100]] (* _Harvey P. Dale_, Jul 08 2019 *)

%o (Magma) [IsOdd(&+Intseq(NthPrime(n))) select 1 else 0: n in [1..100]]; // Bruno Berselli, Nov 15 2011

%Y Cf. A200260, A200261.

%K nonn,base,changed

%O 1

%A _N. J. A. Sloane_, Nov 15 2011

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 March 22 01:15 EDT 2023. Contains 361413 sequences. (Running on oeis4.)