Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A166923
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A166923 Digital sum of prime(n)^2. +0
3
4, 9, 7, 4, 4, 7, 1, 1, 7, 4, 7, 1, 7, 4, 4, 1, 7, 4, 7, 1, 1, 4, 4, 1, 4, 4, 7, 1, 1, 7, 1, 7, 4, 7, 7, 4, 7, 1, 7, 4, 1, 1, 4, 7, 1, 1, 7, 4, 4, 7, 1, 7, 4, 1, 7, 4, 1, 1, 4, 4, 7, 7, 1, 7, 4, 4, 4, 7, 7, 4, 4, 1, 4, 7, 1, 7, 4, 1, 7, 7, 7, 4, 1, 1, 4, 4, 1, 4, 4, 7, 1, 4, 1, 7, 7, 1, 7, 1, 1, 1, 4, 1, 7, 4, 7 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Table[If[(m9=Mod[Prime[n]^2, 9])==0, 9, m9], {n, 200}]

CROSSREFS

Cf. A010888, A038194.

Sequence in context: A053511 A021909 A018880 this_sequence A021205 A056992 A004159

Adjacent sequences: A166920 A166921 A166922 this_sequence A166924 A166925 A166926

KEYWORD

base,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Oct 23 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research