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.

A113763 Non-multiples of 13, or numbers not divisible by 13.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77
Offset: 1

Views

Author

Zak Seidov, Jan 18 2006

Keywords

Comments

Cf. A011760 (Elevator buttons in U.S.A).
Cf. A023806 (all digits in base 12 are different).
Complement of A008595. - Reinhard Zumkeller, Apr 26 2011

Crossrefs

Programs

  • Mathematica
    Table[n+Quotient[2n-1, 24], {n, 1, 85}];(* or *)Table[n+Floor[(2n-1)/24], {n, 1, 85}]
  • PARI
    a(n)=(26*n-1)\24 \\ Charles R Greathouse IV, Jun 08 2015
  • Sage
    [i for i in range(80) if not i%13] # Zerinvary Lajos, Apr 21 2009
    

Formula

a(n) = n+floor((2n-1)/24) = n+quotient(2n-1, 24)

A043286 Maximal run length in base-12 representation of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1
Offset: 1

Views

Author

Keywords

Comments

For all numbers n in A023806, a(n)=1, but this holds also for others, e.g., n=145, not in A023806. The same relation holds for the terms of A113763 less than n=144, but becomes wrong from then on. - M. F. Hasler, Jul 24 2013

Crossrefs

Cf. A043276-A043290 for base-2 to base-16 analogs.

Programs

Extensions

More terms from Antti Karttunen, Dec 06 2017
Showing 1-2 of 2 results.