A123896 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A123896

a(n) = A123895(n^2).

0, 1, 1, 1, 12, 12, 12, 12, 12, 12, 100, 121, 122, 123, 123, 112, 123, 123, 123, 123, 100, 112, 121, 123, 123, 123, 121, 123, 123, 123, 100, 123, 1023, 1023, 1123, 1223, 1234, 1234, 1222, 1231, 1200, 1231, 1234, 1234, 1234, 1012, 1223, 1102, 1203, 1203, 1200

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

REFERENCES

D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.5, p. 432, Problems 4 and 5.

LINKS

Michael De Vlieger, Table of n, a(n) for n = 0..10000

MATHEMATICA

f[n_] := Block[{d = Prepend[IntegerDigits@ n, 0], a, b, w}, b = DeleteDuplicates@ d; a = Range[0, Length@ b]; w = FromDigits@ Flatten[Part[a, FirstPosition[b, #]] & /@ d]; w]; Table[f[n^2], {n, 0, 50}] (* Michael De Vlieger, Dec 09 2015, Version 10 *)

CROSSREFS

Sequence in context: A129498 A010851 A343194 * A122878 A302341 A064162

Adjacent sequences: A123893 A123894 A123895 * A123897 A123898 A123899

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Nov 20 2006

EXTENSIONS

More terms from Franklin T. Adams-Watters, Nov 20 2006

STATUS

approved