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.

A099639 Duplicate of A003555.

Original entry on oeis.org

1, 66, 6216, 617716, 61732716, 6172882716, 617284382716, 61728399382716
Offset: 1

Views

Author

Keywords

A099638 a[n]=A098210[n]/15.

Original entry on oeis.org

1, 77, 7437, 741037, 74077037, 7407437037, 740741037037, 74074077037037, 7407407437037037, 740740741037037037, 74074074077037037037, 7407407407437037037037, 740740740741037037037037
Offset: 1

Views

Author

Labos Elemer, Oct 28 2004

Keywords

Comments

Patterned-digit obtained when (1,5)-half-repdigit is divided by 15, the least such number.This simple generating rule is often[not always] applicable to provide curious digit-patterns. Thus A=1,B=7 give 111..888 numbers divided by 18 results in A003555.

Examples

			n = 20: a[20] = 1111111111111111111155555555555555555555/15 = 74074074074074074077037037037037037037.
		

Crossrefs

Cf. A098210.

Programs

  • Mathematica
    f[x_] := 3*((100^x-1)/9) + 4*(10^x-1)/9 Table[f[w], {w, 1, 20}]/15

Formula

a[n]=A*(((100^n-1)/9)+B*(10^n - 1)/9)/15, where A=1, B=5-A=4.

A286138 Pseudo-palindromic numbers: not palindromes (A002113), but a nontrivial palindromic concatenation (AA or ABA) of arbitrary nonzero integers A and B.

Original entry on oeis.org

1010, 1101, 1121, 1131, 1141, 1151, 1161, 1171, 1181, 1191, 1201, 1211, 1212, 1231, 1241, 1251, 1261, 1271, 1281, 1291, 1301, 1311, 1313, 1321, 1341, 1351, 1361, 1371, 1381, 1391, 1401, 1411, 1414, 1421, 1431, 1451, 1461, 1471, 1481, 1491, 1501, 1511, 1515, 1521, 1531
Offset: 1

Views

Author

M. F. Hasler, May 03 2017

Keywords

Comments

The pseudo- or almost-palindromic numbers considered here are not related to the similarly named but different concepts mentioned in comments on A003555 and in A060087 - A060088.
We could consider "more general" palindromic concatenations like A.B.B.A, A.B.C.B.A, etc., but all of these can be written as A.B'.A with B' = B.B resp. B.C.B, etc. The result is non-palindromic (i.e., not in A002113) as required, if and only if at least one of the strings is non-palindromic.
Here, A is allowed to have only one digit, so most of the first 100 terms are of the form 1.B.1 where B = 10, 12, 13, ... (palindromes 11, 22, 33, ... excluded).
If all of the strings A, B (...) are required to be non-palindromic, the sequence starts with terms of the form A.A with A = 10, 12, 13, ..., 98: 1010, 1212, 1313, 1414, 1515, 1616, 1717, 1818, 1919, 2020, 2121, 2323, .... This is a subsequence of A239019 (numbers which are not primitive words over the alphabet {0,...,9} when written in base 10).

Programs

  • PARI
    A286138 = select(t->!is_A002113(t),setunion(vector(801,i,((i-1)\89+1)*1001+((i-1)%89+1)*10),vector(89,i,(i+9)*101))) \\ The first 810 terms.

A186194 a(n) = A002275(n) * (A002275(n)+1).

Original entry on oeis.org

0, 2, 132, 12432, 1235432, 123465432, 12345765432, 1234568765432, 123456798765432, 12345679098765432, 1234567902098765432, 123456790132098765432, 12345679012432098765432, 1234567901235432098765432, 123456790123465432098765432
Offset: 0

Views

Author

Paul Curtz, Feb 14 2011

Keywords

Comments

a(1),a(2),a(3),a(4),a(5) are (between the two 0's) the cores of the decimal expansions of a(10),a(11),a(12),a(13),a(14).
First differences begin 130,12300,1223000,122230000,....

Examples

			a(1)=1*2=2, a(2)=11*12=132, a(3)=111*112=12432.
		

Programs

  • Mathematica
    LinearRecurrence[{111,-1110,1000},{0,2,132},20] (* Harvey P. Dale, Apr 08 2022 *)

Formula

a(n) = 2*A003555(n+1).
n 1's followed by n 8's is b(n)=18,1188,111888,11118888,1111188888, ...; then a(n)=b(n)/9. See its "contrary" A184337(n+1).
G.f.: 2*x*(-1+45*x) / ( (x-1)*(100*x-1)*(10*x-1) ). - R. J. Mathar, Mar 10 2011

Extensions

Zero added by Franklin T. Adams-Watters, Mar 09 2011
Showing 1-4 of 4 results.