|
Search: id:A131184
|
|
|
| A131184 |
|
n is the rank of pairs of digits (i,j) without zero ranged in order : (1,1) to (1,9);(2,1) to (2,9)....(9,1) to (9,9). For each n we calculate the sequence a(1)=i, a(2)=j, a(n)= a(n-2)*a(n-1) mod 10 All these sequences fall necessarily in a cycle. c(n) is the rank of the last term in the first occurrence of this cycle. |
|
+0
1
|
|
| 2, 7, 6, 4, 2, 2, 6, 7, 3, 8, 6, 8, 6, 3, 6, 8, 6, 8, 6, 8, 6, 8, 2, 8, 6, 8, 6, 5, 6, 8, 3, 3, 3, 8, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 6, 8, 3, 3, 2, 8, 6, 6, 6, 8, 6, 8, 2, 8, 6, 8, 6, 8, 6, 8, 6, 3, 6, 8, 6, 8, 3, 8, 6, 4, 2, 4, 6, 8, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
For n=8 the sequence is 1,8,8,4,2,8,6,[8,8,4,2,8,6]hence c(8)=7
|
|
CROSSREFS
|
Sequence in context: A070524 A021366 A135155 this_sequence A011263 A074067 A110988
Adjacent sequences: A131181 A131182 A131183 this_sequence A131185 A131186 A131187
|
|
KEYWORD
|
easy,fini,full,nonn,uned
|
|
AUTHOR
|
Philippe Lallouet (philip.lallouet(AT)orange.fr), Oct 20 2007
|
|
|
Search completed in 0.002 seconds
|
