Project Euler #254: Sums of Digit Factorials

  • + 22 comments

    Here is some G(i) values.
    None of them contain a digit 0, a pair of 11 nor tripple of 222.
    The digits of all G(i) values are always in increasing(or equal) order.

    G[1] = 1; G[11]= 26; G[21]= 349; G[31]=  229; G[41]=     2355679;
    G[2] = 2; G[12]= 44; G[22]=1349; G[32]= 1229; G[42]=      344479;
    G[3] = 5; G[13]=144; G[23]=2349; G[33]=   39; G[43]=     1344479;
    G[4] =15; G[14]=256; G[24]=  49; G[34]=  139; G[44]=     2378889;
    G[5] =25; G[15]= 36; G[25]= 149; G[35]=  239; G[45]=    12378889;
    G[6] = 3; G[16]=136; G[26]= 249; G[36]= 1239; G[46]=   133378889;
    G[7] =13; G[17]=236; G[27]=   9; G[37]=13339; G[47]= 2356888899L;
    G[8] =23; G[18]= 67; G[28]=  19; G[38]=23599; G[48]=12356888899L;
    G[9] = 6; G[19]=167; G[29]=  29; G[39]= 4479;
    G[10]=16; G[20]=267; G[30]= 129; G[40]=14479;