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

A178485 (A178475(n)-6)/9.

Original entry on oeis.org

1371, 1372, 1381, 1383, 1392, 1393, 1471, 1472, 1491, 1494, 1502, 1504, 1581, 1583, 1591, 1594, 1613, 1614, 1692, 1693, 1702, 1704, 1713, 1714, 2371, 2372, 2381, 2383, 2392, 2393, 2571, 2572, 2601, 2605, 2612, 2615, 2681, 2683, 2701, 2705, 2723, 2725
Offset: 1

Views

Author

M. F. Hasler, May 28 2010

Keywords

Comments

There are 5!=120 terms in this finite sequence. Its origin is the fact that numbers whose decimal expansion is a permutation of 12345 are all of the form 9k+6.

Links

Crossrefs

Cf. A030298, A030299, A055089, A060117, A178486, A191819, A191820.

Programs

  • PARI
    v=vector(5,i,10^(i-1))~; vecsort(vector(5!,i,numtoperm(5,i)*v))
is_A178475(x)= { vecsort(Vec(Str(x)))==Vec("12345") }
forstep( m=12345,54321,9, is_A178475(m) & print1(m","))

Formula

a(n) + a(5!+1-n) = 7406.
a(n) == 1, 2, 3, 4 or 5 (mod 10).
a(n+6)-a(n) is an element of { 100, 110, 111, 200, 220, 222, 679 }.
a(n+6)-a(n) = 679 iff (n-1)%24 > 17, where % denotes the remainder upon division.
a(n+6)-a(n) = 200, 220 or 222 iff (n-1)%30 > 23, i.e. n==25,...,30 (mod 30).

A178486 (A178476(n)-3)/9.

Original entry on oeis.org

13717, 13718, 13727, 13729, 13738, 13739, 13817, 13818, 13837, 13840, 13848, 13850, 13927, 13929, 13937, 13940, 13959, 13960, 14038, 14039, 14048, 14050, 14059, 14060, 14717, 14718, 14727, 14729, 14738, 14739, 14917, 14918, 14947, 14951, 14958, 14961
Offset: 1

Views

Author

M. F. Hasler, May 28 2010

Keywords

Comments

The sequence is motivated by the fact that numbers whose decimal expansion is a permutation of 123456, are all of the form 9k+3.
There are 6!=720 terms in this finite sequence.

Links

Crossrefs

Cf. A030298, A030299, A055089, A060117, A178485, A191819, A191820.

Programs

  • PARI
    forstep( m=123456,654321/*or less*/,9, is_A178476(m) & print1(m\9",")) /*cf. A178476*/

Formula

a(n) + a(6!+1-n) = 86419.
a(n) == 0, 1, 2, 7, 8 or 9 (mod 10).

A191820 A178478(n)/9.

Original entry on oeis.org

1371742, 1371743, 1371752, 1371754, 1371763, 1371764, 1371842, 1371843, 1371862, 1371865, 1371873, 1371875, 1371952, 1371954, 1371962, 1371965, 1371984, 1371985, 1372063, 1372064, 1372073, 1372075, 1372084, 1372085, 1372742, 1372743, 1372752
Offset: 1

Views

Author

Nathaniel Johnston, Jun 24 2011

Keywords

Comments

There are 8!=40320 terms in this finite sequence. Its origin is the fact that numbers whose decimal expansion is a permutation of 12345678 are all divisible by 9.

Links

Crossrefs

Cf. A178485, A178486, A191819.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.