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.

A085096 Index of the first occurrence of n in A082744, or 0 if n does not occur in the sequence A082744.

Original entry on oeis.org

1, 16, 18, 19, 13, 9, 14, 15, 47, 11, 1120, 31, 800, 23, 74, 58, 51, 278, 345, 61, 254, 560, 164, 148, 249, 435, 255, 119, 157, 37, 226, 243, 410, 219, 502, 216, 162, 465, 290, 260, 103, 315, 627, 280, 258, 203, 533, 206, 439, 202, 501, 676, 320, 230, 224, 220, 115
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jul 03 2003

Keywords

Comments

Conjecture: a(11) = 0, or in other words,if 11k+1 is a palindrome then at least one of the numbers in the sequence k+1,2k+1, 3k+1,...,10k+1 is also a palindrome. E.g. for k = 10 and k = 55, 11k+1 is a palindrome but 10*1 +1 and 55*2 +1 are also palindromes.

Crossrefs

Cf. A085094, A085095, A082744.

Extensions

More terms from David Wasserman, Jan 26 2005

A083478 a(n) is the smallest k > 0 such that k*Palindrome(n)+1 is a palindrome.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 6, 10, 5, 7, 8, 2, 9, 3, 4, 6, 100, 10, 5, 4, 3, 2, 2, 2, 2, 2, 50, 50, 5, 4, 3, 2, 2, 2, 2, 2, 40, 40, 40, 7, 797, 2, 2, 2, 2, 2, 25, 30, 25, 420, 8, 2, 2, 2, 2, 2, 20, 20, 20, 20, 20, 2, 32, 117, 24, 28, 20, 20, 20, 20, 20, 89, 9, 52, 1870, 150, 20, 20, 20, 20, 20, 85
Offset: 1

Views

Author

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 03 2003

Keywords

Examples

			a(11) = 5 because A002113(11) = 22 and 111 = 5*22+1.

Links

Crossrefs

Cf. A083477.

Programs

  • Mathematica
    skpal[n_]:=Module[{k=1},While[!PalindromeQ[k*n+1],k++];k]; skpal/@Select[ Range[ 1000],PalindromeQ] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 22 2018 *)

Formula

a(n) = (A083477(n)-1)/A002113(n). a(n) = A082744(A002113(n)). - David Wasserman, Nov 16 2004

Extensions

Corrected and extended by David Wasserman, Nov 16 2004

A082743 a(0)=1, a(1)=2; for n >= 2, a(n) is smallest palindrome greater than 1 which is congruent to 1 (mod n).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 11, 111, 121, 66, 99, 121, 33, 171, 55, 77, 101, 22, 111, 323, 121, 101, 131, 55, 141, 88, 121, 373, 33, 232, 171, 141, 181, 1111, 77, 313, 121, 575, 505, 44, 353, 181, 323, 424, 1441, 99, 101, 868, 313, 10601, 55, 111, 393, 343, 929, 414
Offset: 0

Views

Author

Amarnath Murthy, Apr 15 2003

Keywords

Crossrefs

Cf. A082744, A062388, A077528.

Programs

  • Mathematica
    f[n_] := Block[{k = 2}, While[ FromDigits[ Reverse[ IntegerDigits[k]]] != k || Mod[k, n] != 1, k++ ]; k]; Table[ f[n], {n, 2, 60}]

Formula

a(n) = A077528(n) for n >= 2. - Georg Fischer, Oct 06 2018

Extensions

Edited and extended by Robert G. Wilson v, Apr 19 2003
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.