A108507
Number of paths of length n between two arbitrary, distinct vertices in K5, the complete graph on 5 vertices.
Original entry on oeis.org
1, 3, 6, 18, 48, 78, 96, 132, 132
Offset: 1
a(5) = 48 because there are 48 paths of length 5 between two arbitrary, distinct vertices in K5.
A108508
Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.
Original entry on oeis.org
1, 4, 12, 48, 180, 528, 1392, 3600, 7920, 13680, 21840, 31872, 25008
Offset: 1
a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.
A108509
Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.
Original entry on oeis.org
1, 5, 20, 100, 480, 1980, 7680, 29040, 100920, 316320, 923520, 2502000, 6011760, 12584880, 23417280, 38196480, 50112000, 53667840, 64988160, 64988160
Offset: 1
a(5) = 480 because there are 480 paths of length 5 between two arbitrary, distinct vertices in K7.
A177418
Primes of the form 10^k - 59.
Original entry on oeis.org
41, 941, 9941, 99999941, 99999999999999999941, 99999999999999999999999999999999999941, 99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999941
Offset: 1
-
[a: n in [2..250] | IsPrime(a) where a is 10^n-59];
-
Select[10^Range[0,400] - 59,PrimeQ] (* Harvey P. Dale, Dec 29 2011 *)
Select[Table[FromDigits[PadLeft[{4,1},n,9]],{n,2,400}],PrimeQ] (* Harvey P. Dale, Feb 08 2024 *)
Showing 1-4 of 4 results.
Comments