Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094295
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094295 a(1) =1, a(n) = remainder on dividing the concatenation of all previous terms by n. +0
2
1, 1, 2, 0, 0, 4, 4, 4, 7, 7, 2, 8, 4, 12, 2, 10, 4, 0, 6, 6, 9, 9, 21, 9, 19, 17, 24, 12, 19, 19, 17, 13, 29, 13, 3, 29, 1, 7, 24, 4, 32, 36, 5, 1, 6, 0, 28, 28, 17, 17, 12, 28, 15, 13, 53, 9, 49, 33, 32, 52, 6, 42, 14, 22, 32, 58, 61, 45, 45, 15, 38, 2, 21, 45, 70, 22, 71, 11, 5, 75 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(9) = 7 = 11200444 (mod 9).

MATHEMATICA

f[l_List] := Append[l, Mod[FromDigits[Join @@ IntegerDigits[l]], Length[l] + 1]]; Nest[f, {1}, 80] (*Chandler*)

CROSSREFS

Cf. A094296.

Sequence in context: A137830 A137505 A107498 this_sequence A085969 A117434 A115179

Adjacent sequences: A094292 A094293 A094294 this_sequence A094296 A094297 A094298

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 28 2004

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 05 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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research