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.

A164009 Zero together with row 9 of the array in A163280.

Original entry on oeis.org

0, 19, 38, 51, 76, 75, 114, 105, 136, 162, 190, 209, 264, 273, 308, 345, 384, 425, 468, 513, 560, 609, 660, 713, 768, 825, 884, 945, 1008, 1073, 1140, 1209, 1280, 1353, 1428, 1505, 1584, 1665, 1748, 1833, 1920, 2009, 2100, 2193, 2288, 2385, 2484, 2585, 2688
Offset: 0

Views

Author

Omar E. Pol, Aug 08 2009

Keywords

Crossrefs

Programs

  • Maple
    A033676 := proc(n) local dvs; dvs := sort(convert(numtheory[divisors](n), list)) ; op(floor((nops(dvs)+1)/2) , dvs) ; end proc:
    A163280 := proc(n, k) local r, T ; r := 0 ; for T from k^2 by k do if A033676(T) = k then r := r+1 ; if r = n then return T ; end if; end if; end do: end proc:
    printf("0, ") ; for n from 1 to 90 do printf("%d, ", A163280(9, n)) ; end do ; # R. J. Mathar, Jul 31 2010

Formula

Conjecture: a(n) = A028566(n), n > 12. [R. J. Mathar, Jul 31 2010]

Extensions

Terms beyond a(12) from R. J. Mathar, Jul 31 2010