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.

A351337 Composite terms in A270951.

Original entry on oeis.org

169, 385, 961, 1121, 3741, 3781, 4795, 4901, 6061, 6265, 6441, 6601, 6895, 6931, 7801, 8119, 9809, 9881, 10945, 13981, 14111, 15841, 18241, 18721, 19097, 20833, 23829, 24727, 29953, 30381, 30889, 31417, 34561, 37345, 38081, 40391, 42127, 45961, 47321, 49105
Offset: 1

Views

Author

Bill McEachen, Feb 08 2022

Keywords

Comments

The sequence appears to have no intersection with A128288.

Crossrefs

Intersection of A002808 and A270951.
Cf. A128288.

Programs

  • Mathematica
    q[n_] := CompositeQ[n] && Divisible[Fibonacci[n - 1, 2], n]; Select[Range[50000], q] (* Amiram Eldar, Feb 09 2022 *)
  • PARI
    a000129(n) = ([2, 1; 1, 0]^n)[2, 1];
    is(n) = (n>1) && !isprime(n) && (Mod(a000129(n-1), n) == 0); \\ Michel Marcus, Feb 09 2022; after A270951

A270997 Numbers k such that k | A006190(k-1).

Original entry on oeis.org

1, 3, 10, 17, 23, 29, 33, 43, 53, 61, 79, 101, 103, 107, 113, 127, 131, 139, 157, 173, 179, 181, 191, 199, 211, 233, 251, 257, 263, 269, 277, 283, 311, 313, 337, 347, 367, 373, 385, 389, 419, 433, 439, 443, 467, 491, 503, 521, 523, 547, 561, 563, 569, 571, 599, 601, 607, 641, 647, 649, 653, 659
Offset: 1

Views

Author

Altug Alkan, Mar 28 2016

Keywords

Comments

This sequence appears to generate many prime numbers.
The first few composite terms in this sequence are 10, 33, 385, 561, 649, ...
Contains all members of A038883 except 13. - Robert Israel, Jun 03 2019
That is, contains all primes which are congruent to +-1, +-3 or +-4 (mod 13). - M. F. Hasler, Feb 16 2022

Examples

			10 is a term because A006190(9) = 12970 is divisible by 10.
		

Crossrefs

Programs

  • Maple
    M:= <<3,1>|<1,0>>:
    filter:= proc(n) uses LinearAlgebra[Modular];
      local A;
      A:= Mod(n,M,integer);
      MatrixPower(n,A,n-1)[1,2]=0
    end proc:
    filter(1):= true:
    select(filter, [$1..659]); # Robert Israel, Jun 03 2019
  • Mathematica
    nn = 660; s = LinearRecurrence[{3, 1}, {0, 1}, nn]; Select[Range@ nn, Divisible[s[[#]], #] &](* Michael De Vlieger, Mar 28 2016, after Harvey P. Dale at A006190 *)
  • PARI
    a006190(n) = ([1, 3; 1, 2]^n)[2, 1];
    for(n=1, 1e3, if(Mod(a006190(n-1), n) == 0, print1(n, ", ")));
Showing 1-2 of 2 results.