cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A036513 Smallest square containing exactly n 6's.

Original entry on oeis.org

16, 676, 46656, 1666681, 26666896, 4666665969, 26661664656, 616686666436, 12666666068676, 696626660666596, 16666569616666761, 64666665664666569, 666566667666656964, 16656666666663616576, 6466267667066666666596, 46366666666326666766276
Offset: 1

Views

Author

Keywords

Comments

a(21) > 10^28. - Giovanni Resta, Jul 27 2018

Examples

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

Crossrefs

Cf. A048351. - Jon E. Schoenfield, Jan 24 2009

Programs

  • Mathematica
    a[n_] := Block[{k=1}, While[DigitCount[k^2, 10, 6] != n, k++]; k^2]; Array[a, 6] (* Giovanni Resta, Jul 27 2018 *)

Extensions

a(13)-a(15) from Jon E. Schoenfield, Jan 14 2009
a(16) from Giovanni Resta, Jul 27 2018