Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095244
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095244 a(n) = concatenation n,n-1,n-2,...,3,2,1 mod (prime(n)). +0
3
1, 0, 1, 2, 3, 5, 3, 6, 5, 22, 22, 10, 20, 38, 7, 52, 55, 39, 31, 18, 17, 42, 8, 24, 72, 44, 32, 45, 87, 52, 7, 125, 22, 103, 56, 137, 123, 85, 51, 118, 39, 21, 147, 49, 99, 72, 195, 126, 152, 66, 61, 117, 19, 143, 72, 8, 162, 43, 117, 201 (list; graph; listen)
OFFSET

1,4

EXAMPLE

a(4) = 4321 mod prime(4) = 4321 mod 7 = 2

MATHEMATICA

a = {}; b = {}; For[n = 1, n < 80, n++, a = Join[IntegerDigits[n], a]; AppendTo[b, Mod[FromDigits[a], Prime[n]]]]; b

CROSSREFS

Sequence in context: A151571 A114230 A103781 this_sequence A147593 A108396 A117367

Adjacent sequences: A095241 A095242 A095243 this_sequence A095245 A095246 A095247

KEYWORD

base,nonn,less

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 17 2004

EXTENSIONS

Edited, corrected and extended by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 23 2007

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research