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.

A100432 Bisection of A005349.

Original entry on oeis.org

1, 3, 5, 7, 9, 12, 20, 24, 30, 40, 45, 50, 60, 70, 80, 84, 100, 108, 111, 114, 120, 132, 135, 144, 152, 156, 171, 190, 195, 200, 204, 209, 216, 222, 225, 230, 240, 247, 261, 266, 280, 288, 306, 312, 320, 324, 333, 342, 360, 370, 375, 392, 399, 402, 407, 410, 420
Offset: 1

Views

Author

N. J. A. Sloane, Nov 20 2004

Keywords

Crossrefs

Programs

  • Magma
    A005349:=[n: n in [1..10000] | n mod &+Intseq(n) eq 0];
    A100432:= func< n | A005349[2*n-1] >;
    [A100432(n): n in [1..150]]; // G. C. Greubel, Apr 09 2023
    
  • Maple
    s:=proc(n) local N:N:=convert(n,base,10):sum(N[j],j=1..nops(N)) end:p:=proc(n) if floor(n/s(n))=n/s(n) then n else fi end: A:=[seq(p(n),n=1..440)]: seq(A[2*j-1],j=1..58); # Emeric Deutsch, Dec 16 2004
  • Mathematica
    Select[Range[1000], Divisible[#, Total[IntegerDigits[#]]] &][[1;; ;; 2]] (* G. C. Greubel, Apr 09 2023 *)
  • SageMath
    A005349=[n for n in (1..10^4) if sum(n.digits(base=10)).divides(n)]
    def A100432(n): return A005349[2*n-2]
    [A100432(n) for n in range(1, 151)] # G. C. Greubel, Apr 09 2023

Formula

a(n) = A005349(2*n-1). - G. C. Greubel, Apr 09 2023

Extensions

More terms from Emeric Deutsch, Dec 16 2004