|
|
A089370
|
|
Begin with n and place (n-1) on the most significant side, place (n-2) on the least significant side and so on until a 1 is placed.
|
|
1
|
|
|
1, 12, 231, 1342, 24531, 135642, 2467531, 13578642, 246897531, 13579108642, 2468101197531, 135791112108642, 24681012131197531, 1357911131412108642, 246810121415131197531, 13579111315161412108642
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
First 9 terms are digit reversals of A089369.
|
|
LINKS
|
|
|
EXAMPLE
|
a(6)= 135642 the steps are 6 -> 56 -> 564 -> 3564 -> 35642 -> 135642.
|
|
MATHEMATICA
|
f[n_] := Block[{j = 1, k = n - 1, d = IntegerDigits[n]}, While[k > 0, If[ OddQ[j], d = Join[ IntegerDigits[k], d], d = Join[d, IntegerDigits[k]]]; j++; k-- ]; FromDigits[d]]; Table[ f[n], {n, 17}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|