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.

Showing 1-4 of 4 results.

A108773 Concatenation of n and the sum of the digits of n.

Original entry on oeis.org

0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 112, 123, 134, 145, 156, 167, 178, 189, 1910, 202, 213, 224, 235, 246, 257, 268, 279, 2810, 2911, 303, 314, 325, 336, 347, 358, 369, 3710, 3811, 3912, 404, 415, 426, 437, 448, 459, 4610, 4711, 4812, 4913, 505, 516, 527
Offset: 0

Views

Author

N. J. A. Sloane, Jun 26 2005

Keywords

Comments

A136614(n) = A007953(a(n)) = A007953(A136613(n)). - Reinhard Zumkeller, Jan 13 2008

Crossrefs

Programs

  • Mathematica
    f[n_] := FromDigits[ Join[ IntegerDigits[n], IntegerDigits[Plus @@ IntegerDigits[n]]]]; Table[ f[n], {n, 0, 52}] (* Robert G. Wilson v, Jun 28 2005 *)
  • PARI
    a(n) = eval(concat(Str(n), Str(sumdigits(n)))); \\ Michel Marcus, Nov 12 2023

Extensions

More terms from Robert G. Wilson v, Jun 28 2005

A136613 Concatenation of (sum of digits of n) and n.

Original entry on oeis.org

0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 211, 312, 413, 514, 615, 716, 817, 918, 1019, 220, 321, 422, 523, 624, 725, 826, 927, 1028, 1129, 330, 431, 532, 633, 734, 835, 936, 1037, 1138, 1239, 440, 541, 642, 743, 844, 945, 1046, 1147, 1248, 1349, 550, 651, 752
Offset: 0

Views

Author

Reinhard Zumkeller, Jan 13 2008

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_]:=FromDigits[Join[{DigitSum[n]},IntegerDigits[n]]] (* James C. McMahon, May 06 2025 *)

Formula

A136614(n) = A007953(a(n)) = A007953(A108773(n)).

A173639 Numbers n such that the sum of the digits of 11*n is odd.

Original entry on oeis.org

19, 28, 29, 37, 38, 39, 46, 47, 48, 49, 55, 56, 57, 58, 59, 64, 65, 66, 67, 68, 69, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 119, 128, 129, 137, 138, 139, 146, 147, 148, 149
Offset: 1

Views

Author

David Radcliffe, Nov 23 2010

Keywords

Comments

Note that the first 18 multiples of 11 have even digital sums.
Indices of odd entries in A136614. - R. J. Mathar, Nov 23 2010
a(n) = A075517(n+9) = A248013(n+10) for n <= 36. - Giovanni Resta, Sep 04 2017

Examples

			19 is on the list because 11*19 = 209 and 2+0+9 is odd.
		

Crossrefs

Programs

  • Haskell
    a173639 n = a173639_list !! (n-1)
    a173639_list = filter (odd . a007953 . (* 11)) [0..]
    -- Reinhard Zumkeller, Jul 05 2014
  • Maple
    L := []; for n to 150 do if `mod`(add(i, i = convert(11*n, base, 10)), 2) = 1 then L := [op(L), n] end if end do; L;
  • Mathematica
    Select[Range[200],OddQ[Total[IntegerDigits[11#]]]&] (* Harvey P. Dale, May 28 2012 *)
  • Python
    ans = []
    for n in range(1,151):
        N,s = 11*n,0
        while N:
            s += N % 10
            N //= 10
        if s % 2:
            ans.append(n)
    print(ans)
    

A245627 Base 10 digit sum of 11*n.

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 4, 6, 8, 10, 12, 14, 16, 18, 11, 13, 6, 8, 10, 12, 14, 16, 18, 11, 13, 15, 8, 10, 12, 14, 16, 18, 11, 13, 15, 17, 10, 12, 14, 16, 18, 11, 13, 15, 17, 19, 12, 14, 16, 18, 11, 13, 15, 17, 19, 21, 14, 16, 18, 11, 13, 15, 17, 19, 21, 23, 16, 18, 11, 13, 15, 17, 19, 21, 23, 25, 18, 2
Offset: 0

Views

Author

Alonso del Arte, Jul 27 2014

Keywords

Comments

First term that differs from A136614 is a(91) = 2, compared to A136614(91) = 11.

Examples

			a(90) = 18 because 11 * 90 = 990 and 9 + 9 + 0 = 18.
a(91) = 2 because 11 * 91 = 1001 and 1 + 0 + 0 + 1 = 2.
		

Crossrefs

Programs

  • Maple
    a:= n -> convert(convert(11*n,base,10),`+`):
    seq(a(n),n=0..100); # Robert Israel, Aug 01 2014
  • Mathematica
    Table[Plus@@IntegerDigits[11n], {n, 0, 99}]
  • PARI
    a(n) = sumdigits(11*n); \\ Michel Marcus, Aug 03 2014

Formula

a(n) = A007953(A008593(n)). - Tom Edgar, Jul 27 2014
Showing 1-4 of 4 results.