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.

A247839 Smallest Brady number with n digits.

Original entry on oeis.org

2308, 10830, 119485, 1325165, 14696300, 100729939, 1117112142, 12388963501, 137395710653, 1523741780684, 10443881535043, 115824421096014, 1284512513591197, 14245462070599181, 157984595290182188, 1082842525215598387, 12008907626959811406, 133180826421773523853
Offset: 4

Views

Author

Tim Duffy, Sep 24 2014

Keywords

Comments

If n > 4, 1 < a(n)/10^(n-1) < phi. Successive records are at n = 5, 6, 7, 8, 13, 18, 32, 46, 60, 74, 181, 14807, 29433, 44059, 58685, 1223375, .... - Charles R Greathouse IV, Jan 20 2016

Crossrefs

Cf. A247698.

Programs

  • PARI
    A247698(n)=([1,1;1,0]^n*[1953;355])[1,1]
    a(n)=if(n<5,return(2308)); my(k=log(10^n/15720)\log((1+sqrt(5))/2),t); while(#Str(t=A247698(k))Charles R Greathouse IV, Jan 20 2016

A319604 Largest Brady number with n digits.

Original entry on oeis.org

6569, 73857, 818996, 9082813, 62254526, 690413273, 7656800529, 84915219092, 941724210541, 6454673763134, 71583428964617, 793872392373921, 8804179745077748, 97639849588229149, 669233485047004862, 7421913081219006521, 82310277378456076593, 912834964244235849044
Offset: 4

Views

Author

Joshua Oliver, Sep 24 2018

Keywords

Comments

If a(n) = A247698(k), then a(n+1) = A247698(k+4) or a(n+1) = A247698(k+5). - Charles R Greathouse IV, Dec 10 2019

Crossrefs

Programs

  • Mathematica
    b[1] = 2308; b[2] = 4261; b[n_] := b[n] = b[n-1] + b[n-2]; a[n_] := Block[ {k=1}, While[ IntegerLength[b@k] <= n, k++]; b[k-1]]; a /@ Range[4, 21] (* Giovanni Resta, Sep 24 2018 *)
Showing 1-2 of 2 results.