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-2 of 2 results.

A088133 Sum of first and last digits of n. Different from A115299.

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 8, 9, 10, 11, 12, 13, 14
Offset: 0

Views

Author

Zak Seidov, Sep 20 2003

Keywords

Crossrefs

Cf. A000030 (first digit of n), A010879 (last digit of n).

Programs

  • Mathematica
    Total[{First[IntegerDigits[#]],Last[IntegerDigits[#]]}]&/@Range[90] (* Harvey P. Dale, Aug 21 2018 *)
  • PARI
    apply( {A088133(n)=n\10^logint(n+!n, 10)+n%10}, [0..99]) \\ M. F. Hasler, Apr 22 2024
    
  • Python
    list(map(A088133 := lambda n: int(str(n)[0])+n%10, range(99))) # M. F. Hasler, Apr 22 2024

Formula

a(n) = A000030(n) + A010879(n). - M. F. Hasler, Apr 22 2024

Extensions

Extended to a(0) = 0 by M. F. Hasler, Apr 22 2024

A115300 Greatest digit of n * least digit of n.

Original entry on oeis.org

1, 4, 9, 16, 25, 36, 49, 64, 81, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 0, 6, 12, 18, 24, 30, 36, 42, 48, 54, 0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 0, 8
Offset: 1

Views

Author

Rick L. Shepherd, Jan 20 2006

Keywords

Comments

a(101) = 0 and A111707(101) = 1, but all previous terms match.
a(n) = A169669(n) for n <= 100.

Examples

			a(3) = 3 * 3 = 9, a(232) = 3 * 2 = 6, a(1889009898) = 9 * 0 = 0.
		

Crossrefs

Cf. A037904 (greatest-least), A115299 (greatest+least), A111707.

Programs

  • Haskell
    a115300 n = a054054 n * a054055 n  -- Reinhard Zumkeller, Apr 29 2015
    
  • Mathematica
    Array[Max[#] * Min[#] &@ IntegerDigits[#] &, 81] (* James C. McMahon, Aug 18 2024 *)
  • PARI
    a(n) = my(d=digits(n)); vecmin(d)*vecmax(d); \\ Michel Marcus, Aug 18 2024
  • Python
    def a(n): d = list(map(int, str(n))); return max(d) * min(d)
    print([a(n) for n in range(1, 82)]) # Michael S. Branicky, Dec 12 2023
    

Formula

a(n) = A054054(n)*A054055(n). - Reinhard Zumkeller, Apr 29 2015
Showing 1-2 of 2 results.