For prime n, a(n) is conjectured to be the period of Bell numbers (mod n). See A054767. - T. D. Noe, Oct 12 2007
For prime n, a(n) is a multiple of the period of Bell numbers mod n (and conjectured to be exactly the period, as mentioned above). - Charles R Greathouse IV, Jul 31 2012
For n >= 1, a(n) is the number whose base n representation is a string of n ones. For example, 11111 in base 5 is a(5) = 781. - Melvin Peralta, May 23 2016
For n > 0, n^(a(n)-1) == 1 (mod a(n)), so for n > 1, a(n) is a prime or a Fermat pseudoprime to base n. - Thomas Ordowski, Mar 15 2021