Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141071 a(n)=p(n) mod (sum of base-10 digits of n) where p(n) is the nth prime. +0
1
0, 1, 2, 3, 1, 1, 3, 3, 5, 0, 1, 1, 1, 3, 5, 4, 3, 7, 7, 1, 1, 3, 3, 5, 6, 5, 4, 7, 10, 2, 3, 1, 5, 6, 5, 7, 7, 9, 11, 1, 4, 1, 2, 1, 8, 9, 2, 7, 6, 4, 5, 1, 1, 8, 7, 10, 5, 11, 11, 5, 3, 5, 1, 1, 5, 5, 6, 1, 2, 6, 1, 8, 7, 10 (list; graph; listen)
OFFSET

1,3
CROSSREFS

Sequence in context: A077233 A123185 A133569 this_sequence A004648 A139438 A135392

Adjacent sequences: A141068 A141069 A141070 this_sequence A141072 A141073 A141074

KEYWORD

nonn,base

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru) Aug 4 2008

EXTENSIONS

Corrected and edited by D. S. McNeil, Mar 21 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 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.