|
Search: id:A068097
|
|
|
| A068097 |
|
a(1) = 1; a(n+1) = smallest triangular numbers starting with a(n). |
|
+0
1
|
|
| 1, 10, 105, 10585, 105858525, 10585852585252500, 105858525852525008525250025000000, 10585852585252500852525002500000085252500250000002500000000000000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(n+1)=floor((sqrt(8*10^floor(log(a(n))/log(10))*a(n)+1)+1)/2)*(floor((sqrt(8*10^floor(log(a(n))/log(10))*a(n)+1)+1)/2)+1)/2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 25 2002
|
|
PROGRAM
|
PARI with 1000 significant digits : a(1)=1, a(2)=10 and for n>2 s=10; for(i=1, 10, s=floor((sqrt(8*10^floor(log(s)/log(10))*s+1)+1)/2)*(floor((sqrt(8*10^floor(log(s)/log(10))*s+1)+1)/2)+1)/2; print1(s, ", "); );
|
|
CROSSREFS
|
Sequence in context: A113348 A068883 A087599 this_sequence A142987 A078192 A015589
Adjacent sequences: A068094 A068095 A068096 this_sequence A068098 A068099 A068100
|
|
KEYWORD
|
base,hard,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 19 2002
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 24 2002
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 07 2002
|
|
|
Search completed in 0.002 seconds
|
