1,1

a[n]=Min{x; Mod[ -1+n^(x-1), x where x is true-power-of-prime}

n=2: -1+2^(1092.1094)=K.1093.1093=K.1194649;

n=4k+1: a[4k+1]=4; for a[k]=9 see A090097;a[k]=25 see A090098.

some large values:

a(12)=2693.2693;a(20)=78961; a(52)=219521;a(56)=418609=647^2;

a(58)=17161;a(84)=26569;a(104)=97969; a(119)=3031081;

Stiff bases below 100 are: 6,15,34,36,39,47,59,66,72,83,86,87,88,90,92,95

t=list-of-true-p-powers-generated-independently lf[x_] := Length[FactorInteger[x]] base=6; Do[s=Mod[ -1+base^(Part[t, n]-1), Part[t, n]]; If[Equal[s, 0], Print[Part[t, n]]], {n, 1, Length[t]}]

Cf. A007535, A090086.

Sequence in context: A058430 A079286 A124119 this_sequence A046362 A058424 A065248

Adjacent sequences: A090093 A090094 A090095 this_sequence A090097 A090098 A090099

nonn

Labos E. (labos(AT)ana.sote.hu), Dec 01 2003