[Boilerplate dubs claiming statement for future post]

[Statement elaborating on title]

(11 * n)

Checkem

Program me a fish

/prague/ challenge #84817719912982823

Let D(n) denote the ``dubs number'' of n, where the ``dubs number'' of n is defined to be the number of dubs less than or equal to n. Find a closed form expression for D(n) or prove no such closed form exists.

>>5

Whatever works man.

11 * (n mod 10) + 100 * (floor(n/10) mod 10)

Tested with a haskell spreadsheet running in homomorphosexual endoeigentensor homomorphic homo mode.

homo